Giles, Michael B. Multilevel Monte Carlo path simulation. (English) Zbl 1167.65316 Oper. Res. 56, No. 3, 607-617 (2008). MSC: 65C05 68Q25 91G60 PDFBibTeX XMLCite \textit{M. B. Giles}, Oper. Res. 56, No. 3, 607--617 (2008; Zbl 1167.65316) Full Text: DOI
Kincaid, R. K.; Nicol, D. M.; Shier, D. R.; Richards, D. A multistage linear array assignment problem. (English) Zbl 0722.68014 Oper. Res. 38, No. 6, 993-1005 (1990). MSC: 68M20 68M10 68Q25 90C90 PDFBibTeX XMLCite \textit{R. K. Kincaid} et al., Oper. Res. 38, No. 6, 993--1005 (1990; Zbl 0722.68014) Full Text: DOI Link
Wolsey, Laurence A. Uncapacitated lot-sizing problems with start-up costs. (English) Zbl 0696.90021 Oper. Res. 37, No. 5, 741-747 (1989). Reviewer: R.Fahrion MSC: 90B05 90C11 90C39 68Q25 PDFBibTeX XMLCite \textit{L. A. Wolsey}, Oper. Res. 37, No. 5, 741--747 (1989; Zbl 0696.90021) Full Text: DOI Link
Ahuja, R. K.; Orlin, James B. A fast and simple algorithm for the maximum flow problem. (English) Zbl 0691.90024 Oper. Res. 37, No. 5, 748-759 (1989). Reviewer: E.Ciurea MSC: 90B10 68Q25 68N25 PDFBibTeX XMLCite \textit{R. K. Ahuja} and \textit{J. B. Orlin}, Oper. Res. 37, No. 5, 748--759 (1989; Zbl 0691.90024) Full Text: DOI Link
Monma, Clyde L.; Potts, Chris N. On the complexity of scheduling with batch setup times. (English) Zbl 0686.90025 Oper. Res. 37, No. 5, 798-804 (1989). Reviewer: S.K.Goyal MSC: 90B35 68Q25 90C39 PDFBibTeX XMLCite \textit{C. L. Monma} and \textit{C. N. Potts}, Oper. Res. 37, No. 5, 798--804 (1989; Zbl 0686.90025) Full Text: DOI
Christofides, Nicos; Benavent, Enrique An exact algorithm for the quadratic assignment problem on a tree. (English) Zbl 0682.90064 Oper. Res. 37, No. 5, 760-768 (1989). MSC: 90C10 90C35 68Q25 90C27 90C39 65K05 05C05 PDFBibTeX XMLCite \textit{N. Christofides} and \textit{E. Benavent}, Oper. Res. 37, No. 5, 760--768 (1989; Zbl 0682.90064) Full Text: DOI
Glover, Fred; Klingman, Darwin New sharpness properties, algorithms and complexity bounds for partitioning shortest path procedures. (English) Zbl 0677.90078 Oper. Res. 37, No. 4, 542-546 (1989). MSC: 90C35 68Q25 PDFBibTeX XMLCite \textit{F. Glover} and \textit{D. Klingman}, Oper. Res. 37, No. 4, 542--546 (1989; Zbl 0677.90078) Full Text: DOI
Batta, Rajan The stochastic queue median over a finite discrete set. (English) Zbl 0675.90027 Oper. Res. 37, No. 4, 648-652 (1989). MSC: 90B05 68Q25 60K25 90B22 PDFBibTeX XMLCite \textit{R. Batta}, Oper. Res. 37, No. 4, 648--652 (1989; Zbl 0675.90027) Full Text: DOI
Fischetti, Matteo; Martello, Silvano; Toth, Paolo The fixed job schedule problem with working-time constraints. (English) Zbl 0672.90074 Oper. Res. 37, No. 3, 395-403 (1989). MSC: 90B35 68Q25 68M20 PDFBibTeX XMLCite \textit{M. Fischetti} et al., Oper. Res. 37, No. 3, 395--403 (1989; Zbl 0672.90074) Full Text: DOI
Lawler, E. L.; Martel, C. U. Preemptive scheduling of two uniform machines to minimizing the number of late jobs. (English) Zbl 0672.90071 Oper. Res. 37, No. 2, 314-318 (1989). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{E. L. Lawler} and \textit{C. U. Martel}, Oper. Res. 37, No. 2, 314--318 (1989; Zbl 0672.90071) Full Text: DOI
Ali, Agha Iqbal; Padman, Rema; Thiagarajan, Hemalatha Dual algorithms for pure network problems. (English) Zbl 0661.90030 Oper. Res. 37, No. 1, 159-171 (1989). MSC: 90B10 90C27 65K05 90C35 68Q25 90C08 90C06 PDFBibTeX XMLCite \textit{A. I. Ali} et al., Oper. Res. 37, No. 1, 159--171 (1989; Zbl 0661.90030) Full Text: DOI
Matsuo, Hirofumi The weighted total tardiness problem with fixed shipping times and overtime utilization. (English) Zbl 0655.90037 Oper. Res. 36, No. 2, 293-307 (1988). Reviewer: Y.M.Shafranskij MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{H. Matsuo}, Oper. Res. 36, No. 2, 293--307 (1988; Zbl 0655.90037) Full Text: DOI
Liu, C. Y.; Bulfin, R. L. Scheduling open shops with unit execution times to minimize functions of due dates. (English) Zbl 0652.90063 Oper. Res. 36, No. 4, 533-559 (1988). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{C. Y. Liu} and \textit{R. L. Bulfin}, Oper. Res. 36, No. 4, 533--559 (1988; Zbl 0652.90063) Full Text: DOI
Tang, Christopher S. A max-min allocation problem: Its solutions and applications. (English) Zbl 0648.90032 Oper. Res. 36, No. 2, 359-367 (1988). Reviewer: R.Slowinski MSC: 90B30 90C10 65K05 90B35 68Q25 90C90 PDFBibTeX XMLCite \textit{C. S. Tang}, Oper. Res. 36, No. 2, 359--367 (1988; Zbl 0648.90032) Full Text: DOI
Simchi-Levi, David; Berman, Oded A heuristic algorithm for the traveling salesman location problem on networks. (English) Zbl 0647.90097 Oper. Res. 36, No. 3, 478-484 (1988). MSC: 90C35 68Q25 90B05 65K05 90C10 PDFBibTeX XMLCite \textit{D. Simchi-Levi} and \textit{O. Berman}, Oper. Res. 36, No. 3, 478--484 (1988; Zbl 0647.90097) Full Text: DOI
Fischetti, Matteo; Martello, Silvano; Toth, Paolo The fixed job schedule problem with spread-time constraints. (English) Zbl 0638.90055 Oper. Res. 35, No. 6, 849-858 (1987). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{M. Fischetti} et al., Oper. Res. 35, 849--858 (1987; Zbl 0638.90055) Full Text: DOI
Mitchell, Joseph S. B. 98%-effective lot-sizing for one-warehouse, multi-retailer inventory systems with backlogging. (English) Zbl 0631.90022 Oper. Res. 35, 399-404 (1987). MSC: 90B05 68Q25 PDFBibTeX XMLCite \textit{J. S. B. Mitchell}, Oper. Res. 35, 399--404 (1987; Zbl 0631.90022) Full Text: DOI
Warburton, Arthur Approximation of Pareto optima in multiple-objective, shortest-path problems. (English) Zbl 0623.90084 Oper. Res. 35, 70-79 (1987). Reviewer: W.Li MSC: 90C35 90C31 68Q25 PDFBibTeX XMLCite \textit{A. Warburton}, Oper. Res. 35, 70--79 (1987; Zbl 0623.90084) Full Text: DOI
Tardos, Éva A strongly polynomial algorithm to solve combinatorial linear programs. (English) Zbl 0626.90053 Oper. Res. 34, 250-256 (1986). Reviewer: W.Stanczak MSC: 90C05 68Q25 90C27 90C06 65K05 PDFBibTeX XMLCite \textit{É. Tardos}, Oper. Res. 34, 250--256 (1986; Zbl 0626.90053) Full Text: DOI
Hooker, John Solving nonlinear single-facility network location problems. (English) Zbl 0619.90020 Oper. Res. 34, 732-743 (1986). Reviewer: W.Stanczak MSC: 90B05 68Q25 90C90 90C35 68R10 90C25 PDFBibTeX XMLCite \textit{J. Hooker}, Oper. Res. 34, 732--743 (1986; Zbl 0619.90020) Full Text: DOI
Gavish, Bezalel; Srikanth, Kizhanathan An optimal solution method for large-scale multiple traveling salesman problems. (English) Zbl 0612.90099 Oper. Res. 34, 698-717 (1986). MSC: 90C35 68Q25 65K05 90C10 90C27 PDFBibTeX XMLCite \textit{B. Gavish} and \textit{K. Srikanth}, Oper. Res. 34, 698--717 (1986; Zbl 0612.90099) Full Text: DOI
Sidney, Jeffrey B.; Steiner, George Optimal sequencing by modular decomposition: Polynomial algorithms. (English) Zbl 0609.90068 Oper. Res. 34, 606-612 (1986). MSC: 90B35 68Q25 90C39 PDFBibTeX XMLCite \textit{J. B. Sidney} and \textit{G. Steiner}, Oper. Res. 34, 606--612 (1986; Zbl 0609.90068) Full Text: DOI
Orlin, James B. Some very easy knapsack/partition problems. (English) Zbl 0581.90063 Oper. Res. 33, 1154-1160 (1985). MSC: 90C10 68Q25 PDFBibTeX XMLCite \textit{J. B. Orlin}, Oper. Res. 33, 1154--1160 (1985; Zbl 0581.90063) Full Text: DOI
Queyranne, Maurice Bounds for assembly line balancing heuristics. (English) Zbl 0579.90054 Oper. Res. 33, 1353-1359 (1985). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{M. Queyranne}, Oper. Res. 33, 1353--1359 (1985; Zbl 0579.90054) Full Text: DOI
Maxwell, William L.; Muckstadt, John A. Establishing consistent and realistic reorder intervals in production- distribution systems. (English) Zbl 0579.90048 Oper. Res. 33, 1316-1341 (1985). MSC: 90B30 90B05 90C90 90C30 65K05 90C10 68Q25 PDFBibTeX XMLCite \textit{W. L. Maxwell} and \textit{J. A. Muckstadt}, Oper. Res. 33, 1316--1341 (1985; Zbl 0579.90048) Full Text: DOI
Glover, F.; Klingman, D.; Phillips, N. A new polynomially bounded shortest path algorithm. (English) Zbl 0578.90089 Oper. Res. 33, 65-73 (1985). MSC: 90C35 68Q25 05C35 PDFBibTeX XMLCite \textit{F. Glover} et al., Oper. Res. 33, 65--73 (1985; Zbl 0578.90089) Full Text: DOI
Posner, Marc E. Minimizing weighted completion times with deadlines. (English) Zbl 0575.90030 Oper. Res. 33, 562-574 (1985). Reviewer: F.Turnovec MSC: 90B35 68Q25 65K05 PDFBibTeX XMLCite \textit{M. E. Posner}, Oper. Res. 33, 562--574 (1985; Zbl 0575.90030) Full Text: DOI
Martins, Ernesto Q. V.; Rosa, Mario S. An algorithm for the maximal multicommodity funnel-node flow in an undirected network. (English) Zbl 0572.90023 Oper. Res. 33, 537-547 (1985). Reviewer: V.Peteanu MSC: 90B10 68Q25 PDFBibTeX XMLCite \textit{E. Q. V. Martins} and \textit{M. S. Rosa}, Oper. Res. 33, 537--547 (1985; Zbl 0572.90023) Full Text: DOI
Ong, Hoon Liong; Magazine, M. J.; Wee, T. S. Probabilistic analysis of bin packing heuristics. (English) Zbl 0551.90067 Oper. Res. 32, 983-998 (1984). MSC: 90C10 05C70 65K05 68Q25 PDFBibTeX XMLCite \textit{H. L. Ong} et al., Oper. Res. 32, 983--998 (1984; Zbl 0551.90067) Full Text: DOI
Agrawal, Avinash; Barlow, Richard E. A survey of network reliability and domination theory. (English) Zbl 0544.90049 Oper. Res. 32, 478-492 (1984). MSC: 90B25 90C90 90-02 68Q25 PDFBibTeX XMLCite \textit{A. Agrawal} and \textit{R. E. Barlow}, Oper. Res. 32, 478--492 (1984; Zbl 0544.90049) Full Text: DOI
Provan, J. Scott; Ball, Michael O. Computing network reliability in time polynomial in the number of cuts. (English) Zbl 0544.90034 Oper. Res. 32, 516-526 (1984). MSC: 90B25 62N05 68Q25 PDFBibTeX XMLCite \textit{J. S. Provan} and \textit{M. O. Ball}, Oper. Res. 32, 516--526 (1984; Zbl 0544.90034) Full Text: DOI
Agrawal, Avinash; Satyanarayana, A. An \(O(| E|)\) time algorithm for computing the reliability of a class of directed networks. (English) Zbl 0544.90033 Oper. Res. 32, 493-515 (1984). MSC: 90B25 68Q25 68R10 PDFBibTeX XMLCite \textit{A. Agrawal} and \textit{A. Satyanarayana}, Oper. Res. 32, 493--515 (1984; Zbl 0544.90033) Full Text: DOI
Simons, Barbara; Sipser, Michael On scheduling unit-length jobs with multiple release time/deadline intervals. (English) Zbl 0531.90048 Oper. Res. 32, 80-88 (1984). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{B. Simons} and \textit{M. Sipser}, Oper. Res. 32, 80--88 (1984; Zbl 0531.90048) Full Text: DOI
Akileswaran, V.; Hazen, G. B.; Morin, T. L. Complexity of the project sequencing problem. (English) Zbl 0538.90035 Oper. Res. 31, 772-778 (1983). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{V. Akileswaran} et al., Oper. Res. 31, 772--778 (1983; Zbl 0538.90035) Full Text: DOI
Hung, Ming S. A polynomial simplex method for the assignment problem. (English) Zbl 0519.90056 Oper. Res. 31, 595-600 (1983). MSC: 90C08 68Q25 90C05 65K05 PDFBibTeX XMLCite \textit{M. S. Hung}, Oper. Res. 31, 595--600 (1983; Zbl 0519.90056) Full Text: DOI
Munro, J. Ian; Ramirez, Raul J. Reducing space requirements for shortest path problems. (English) Zbl 0492.90080 Oper. Res. 30, 1009-1013 (1982). MSC: 90C35 05C35 90B10 68Q25 PDFBibTeX XMLCite \textit{J. I. Munro} and \textit{R. J. Ramirez}, Oper. Res. 30, 1009--1013 (1982; Zbl 0492.90080) Full Text: DOI
Monma, Clyde L. Linear-time algorithms for scheduling on parallel processors. (English) Zbl 0481.90048 Oper. Res. 30, 116-124 (1982). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{C. L. Monma}, Oper. Res. 30, 116--124 (1982; Zbl 0481.90048) Full Text: DOI
Leung, Joseph Y.-T. On scheduling independent tasks with restricted execution times. (English) Zbl 0481.90046 Oper. Res. 30, 163-171 (1982). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{J. Y. T. Leung}, Oper. Res. 30, 163--171 (1982; Zbl 0481.90046) Full Text: DOI
Bland, Robert G.; Goldfarb, Donald; Todd, Michael J. The ellipsoid method: A survey. (English) Zbl 0474.90056 Oper. Res. 29, 1039-1091 (1981). MSC: 90C05 90-02 68Q25 65K05 PDFBibTeX XMLCite \textit{R. G. Bland} et al., Oper. Res. 29, 1039--1091 (1981; Zbl 0474.90056) Full Text: DOI
Picard, Jean-Claude; Queyranne, Maurice On the one-dimensional space allocation problem. (English) Zbl 0473.90057 Oper. Res. 29, 371-391 (1981). MSC: 90C10 90B35 65K05 90C39 68Q25 PDFBibTeX XMLCite \textit{J.-C. Picard} and \textit{M. Queyranne}, Oper. Res. 29, 371--391 (1981; Zbl 0473.90057) Full Text: DOI Link
Bartholdi, John J. III A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. (English) Zbl 0466.90037 Oper. Res. 29, 501-510 (1981). MSC: 90B35 90C10 65K05 68Q25 90C90 PDFBibTeX XMLCite \textit{J. J. Bartholdi III}, Oper. Res. 29, 501--510 (1981; Zbl 0466.90037) Full Text: DOI
Cho, Yookun; Sahni, Sartaj Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. (English) Zbl 0455.90043 Oper. Res. 29, 511-522 (1981). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{Y. Cho} and \textit{S. Sahni}, Oper. Res. 29, 511--522 (1981; Zbl 0455.90043) Full Text: DOI
Chvatal, Vasek Hard knapsack problems. (English) Zbl 0447.90063 Oper. Res. 28, 1402-1411 (1980). MSC: 90C09 90C39 68Q25 PDFBibTeX XMLCite \textit{V. Chvatal}, Oper. Res. 28, 1402--1411 (1980; Zbl 0447.90063) Full Text: DOI
Hung, Ming S.; Rom, Walter O. Solving the assignment problem by relaxation. (English) Zbl 0441.90062 Oper. Res. 28, 969-982 (1980). MSC: 90C08 68Q25 65K05 90B10 PDFBibTeX XMLCite \textit{M. S. Hung} and \textit{W. O. Rom}, Oper. Res. 28, 969--982 (1980; Zbl 0441.90062) Full Text: DOI
Monma, Clyde L. Sequencing to minimize the maximum job cost. (English) Zbl 0423.68006 Oper. Res. 28, 942-951 (1980). MSC: 68M20 68Q25 PDFBibTeX XMLCite \textit{C. L. Monma}, Oper. Res. 28, 942--951 (1980; Zbl 0423.68006) Full Text: DOI
Sidney, Jeffrey B. The two-machine maximum flow time problem with series parallel precedence relations. (English) Zbl 0426.90047 Oper. Res. 27, 782-791 (1979). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{J. B. Sidney}, Oper. Res. 27, 782--791 (1979; Zbl 0426.90047) Full Text: DOI
Sahni, Sartaj Preemptive scheduling with due dates. (English) Zbl 0424.90031 Oper. Res. 27, 925-934 (1979). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{S. Sahni}, Oper. Res. 27, 925--934 (1979; Zbl 0424.90031) Full Text: DOI
Monma, Clyde L. The two-machine maximum flow time problem with series-parallel precedence constraints: An algorithm and extensions. (English) Zbl 0419.90046 Oper. Res. 27, 792-798 (1979). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{C. L. Monma}, Oper. Res. 27, 792--798 (1979; Zbl 0419.90046) Full Text: DOI
Hindelang, Thomas J.; Muth, John F. A dynamic programming algorithm for decision CPM networks. (English) Zbl 0396.90097 Oper. Res. 27, 225-241 (1979). MSC: 90C35 90C39 68Q25 65K05 90C90 PDFBibTeX XMLCite \textit{T. J. Hindelang} and \textit{J. F. Muth}, Oper. Res. 27, 225--241 (1979; Zbl 0396.90097) Full Text: DOI
Kao, Edward P. C. A multi-product dynamic lot-size model with individual and joint set-up costs. (English) Zbl 0394.90031 Oper. Res. 27, 279-289 (1979). MSC: 90B05 90C90 90C39 65K05 68Q25 PDFBibTeX XMLCite \textit{E. P. C. Kao}, Oper. Res. 27, 279--289 (1979; Zbl 0394.90031) Full Text: DOI
Denardo, Eric V.; Fox, Bennett L. Shortest-route methods: 1. Reaching, pruning, and buckets. (English) Zbl 0391.90089 Oper. Res. 27, 161-186 (1979). MSC: 90C35 05C35 68Q25 65K05 PDFBibTeX XMLCite \textit{E. V. Denardo} and \textit{B. L. Fox}, Oper. Res. 27, 161--186 (1979; Zbl 0391.90089) Full Text: DOI
Lakshminarayan, Sankaran; Lakshmanan, Ram; Papineall, Robert L.; Rochette, Rene Optimal single-machine scheduling with earliness and tardiness penalties. (English) Zbl 0413.90031 Oper. Res. 26, 1079-1082 (1978). MSC: 90B35 68Q25 68Q60 PDFBibTeX XMLCite \textit{S. Lakshminarayan} et al., Oper. Res. 26, 1079--1082 (1978; Zbl 0413.90031) Full Text: DOI
Ostresh, Lawrence M. jun. On the convergence of a class of iterative methods for solving the Weber location problem. (English) Zbl 0396.90073 Oper. Res. 26, 597-609 (1978). MSC: 90C30 41A25 65K05 68Q25 PDFBibTeX XMLCite \textit{L. M. Ostresh jun.}, Oper. Res. 26, 597--609 (1978; Zbl 0396.90073) Full Text: DOI
Su, Zaw-Sing; Sevcik, Kenneth C. A combinatorial approach to dynamic scheduling problems. (English) Zbl 0396.90043 Oper. Res. 26, 836-844 (1978). MSC: 90B35 90C90 68Q25 PDFBibTeX XMLCite \textit{Z.-S. Su} and \textit{K. C. Sevcik}, Oper. Res. 26, 836--844 (1978; Zbl 0396.90043) Full Text: DOI
Fox, B. L. Data structures and computer science techniques in operations research. (English) Zbl 0395.90026 Oper. Res. 26, 686-717 (1978). MSC: 90Bxx 90C90 68W99 68Q25 65K05 65C20 68Q60 68P05 PDFBibTeX XMLCite \textit{B. L. Fox}, Oper. Res. 26, 686--717 (1978; Zbl 0395.90026) Full Text: DOI
Chandra, A. K.; Hirschberg, D. S.; Wong, C. K. Bin packing with geometric constraints in computer network design. (English) Zbl 0388.68053 Oper. Res. 26, 760-772 (1978). MSC: 68Q25 68W99 90B10 PDFBibTeX XMLCite \textit{A. K. Chandra} et al., Oper. Res. 26, 760--772 (1978; Zbl 0388.68053) Full Text: DOI
Sahni, Sartaj; Horowitz, Ellis Combinatorial problems: Reducibility and approximation. (English) Zbl 0388.68041 Oper. Res. 26, 718-759 (1978). MSC: 68W99 68Q25 68M20 05A05 90C08 90C05 90C35 PDFBibTeX XMLCite \textit{S. Sahni} and \textit{E. Horowitz}, Oper. Res. 26, 718--759 (1978; Zbl 0388.68041) Full Text: DOI
Sahni, Sartaj General techniques for combinatorial approximation. (English) Zbl 0386.90048 Oper. Res. 26, 920-936 (1978). MSC: 90C10 90-02 65K05 68Q25 05A99 90B35 90B10 90C35 90C09 PDFBibTeX XMLCite \textit{S. Sahni}, Oper. Res. 26, 920--936 (1978; Zbl 0386.90048) Full Text: DOI
Lawler, E. L.; Sivazlian, B. D. Minimization of time-varying costs in single-machine scheduling. (English) Zbl 0385.90055 Oper. Res. 26, 563-569 (1978). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{E. L. Lawler} and \textit{B. D. Sivazlian}, Oper. Res. 26, 563--569 (1978; Zbl 0385.90055) Full Text: DOI
Houck, David J.; Vemuganti, R. Rao An algorithm for the vertex packing problem. (English) Zbl 0383.90101 Oper. Res. 25, 773-787 (1977). MSC: 90C35 05B40 65K05 68Q25 94C15 PDFBibTeX XMLCite \textit{D. J. Houck} and \textit{R. R. Vemuganti}, Oper. Res. 25, 773--787 (1977; Zbl 0383.90101) Full Text: DOI
O’Neill, Richard P. Column dropping in the Dantzig-Wolfe convex programming algorithm: Computational experience. (English) Zbl 0383.90088 Oper. Res. 25, 148-155 (1977). MSC: 90C25 65K05 68Q25 PDFBibTeX XMLCite \textit{R. P. O'Neill}, Oper. Res. 25, 148--155 (1977; Zbl 0383.90088) Full Text: DOI
Shaftel, Timothy L.; Thompson, Gerald L. A simplex-like algorithm for the continuous modular design problem. (English) Zbl 0383.90080 Oper. Res. 25, 788-807 (1977). MSC: 90C10 90C90 65K05 68Q25 PDFBibTeX XMLCite \textit{T. L. Shaftel} and \textit{G. L. Thompson}, Oper. Res. 25, 788--807 (1977; Zbl 0383.90080) Full Text: DOI
Etcheberry, Javier The set-covering problem: A new implicit enumeration algorithm. (English) Zbl 0383.90077 Oper. Res. 25, 760-772 (1977). MSC: 90C09 05B40 65K05 90C05 68Q25 05A15 PDFBibTeX XMLCite \textit{J. Etcheberry}, Oper. Res. 25, 760--772 (1977; Zbl 0383.90077) Full Text: DOI