Morrison, David R.; Jacobson, Sheldon H.; Sauppe, Jason J.; Sewell, Edward C. Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. (English) Zbl 1387.90010 Discrete Optim. 19, 79-102 (2016). MSC: 90-02 90C57 90C10 90C27 PDF BibTeX XML Cite \textit{D. R. Morrison} et al., Discrete Optim. 19, 79--102 (2016; Zbl 1387.90010) Full Text: DOI
Lin, Fu; Leyffer, Sven; Munson, Todd A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings. (English) Zbl 1353.90093 Comput. Optim. Appl. 65, No. 1, 1-46 (2016). MSC: 90C11 90C06 91B32 90C90 PDF BibTeX XML Cite \textit{F. Lin} et al., Comput. Optim. Appl. 65, No. 1, 1--46 (2016; Zbl 1353.90093) Full Text: DOI arXiv
Bidhandi, Hadi Mohammadi; Yusuff, Rosnah Mohd.; Ahmad, Megat Mohamad Hamdan Megat; Bakar, Mohd Rizam Abu Development of a new approach for deterministic supply chain network design. (English) Zbl 1163.90667 Eur. J. Oper. Res. 198, No. 1, 121-128 (2009). MSC: 90C11 90C27 PDF BibTeX XML Cite \textit{H. M. Bidhandi} et al., Eur. J. Oper. Res. 198, No. 1, 121--128 (2009; Zbl 1163.90667) Full Text: DOI
Sherali, Hanif D.; Glover, Fred Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities. (English) Zbl 1151.90496 Discrete Optim. 5, No. 2, 270-289 (2008). MSC: 90C09 90C27 PDF BibTeX XML Cite \textit{H. D. Sherali} and \textit{F. Glover}, Discrete Optim. 5, No. 2, 270--289 (2008; Zbl 1151.90496) Full Text: DOI
Glover, Fred; Sherali, Hanif D. Second-order cover inequalities. (English) Zbl 1145.90042 Math. Program. 114, No. 2 (A), 207-234 (2008). MSC: 90C10 90C27 PDF BibTeX XML Cite \textit{F. Glover} and \textit{H. D. Sherali}, Math. Program. 114, No. 2 (A), 207--234 (2008; Zbl 1145.90042) Full Text: DOI
Balev, Stefan; Yanev, Nicola; Fréville, Arnaud; Andonov, Rumen A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem. (English) Zbl 1138.90015 Eur. J. Oper. Res. 186, No. 1, 63-76 (2008). MSC: 90C10 90C39 90C59 PDF BibTeX XML Cite \textit{S. Balev} et al., Eur. J. Oper. Res. 186, No. 1, 63--76 (2008; Zbl 1138.90015) Full Text: DOI
Patriksson, Michael A survey on the continuous nonlinear resource allocation problem. (English) Zbl 1146.90493 Eur. J. Oper. Res. 185, No. 1, 1-46 (2008). MSC: 90C25 90B05 90C06 90B06 90C30 PDF BibTeX XML Cite \textit{M. Patriksson}, Eur. J. Oper. Res. 185, No. 1, 1--46 (2008; Zbl 1146.90493) Full Text: DOI
Amen, Matthias Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds. (English) Zbl 1083.90012 Eur. J. Oper. Res. 168, No. 3, 747-770 (2006). MSC: 90B30 90B80 PDF BibTeX XML Cite \textit{M. Amen}, Eur. J. Oper. Res. 168, No. 3, 747--770 (2006; Zbl 1083.90012) Full Text: DOI
Padberg, Manfred Classical cuts for mixed-integer programming and branch-and-cut. (English) Zbl 1135.90369 Ann. Oper. Res. 139, 321-352 (2005). MSC: 90C11 90C57 90C08 PDF BibTeX XML Cite \textit{M. Padberg}, Ann. Oper. Res. 139, 321--352 (2005; Zbl 1135.90369) Full Text: DOI
Fréville, Arnaud The multidimensional 0-1 knapsack problem: an overview. (English) Zbl 1045.90050 Eur. J. Oper. Res. 155, No. 1, 1-21 (2004). MSC: 90C27 90C59 90C57 PDF BibTeX XML Cite \textit{A. Fréville}, Eur. J. Oper. Res. 155, No. 1, 1--21 (2004; Zbl 1045.90050) Full Text: DOI
Joseph, Anito; Gass, Saul I.; Bryson, Noel An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem. (English) Zbl 0955.90110 Eur. J. Oper. Res. 104, No. 3, 601-614 (1998). MSC: 90C27 90C10 PDF BibTeX XML Cite \textit{A. Joseph} et al., Eur. J. Oper. Res. 104, No. 3, 601--614 (1998; Zbl 0955.90110) Full Text: DOI
Freville, Arnaud; Plateau, Gérard An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem. (English) Zbl 0802.90077 Discrete Appl. Math. 49, No. 1-3, 189-212 (1994). MSC: 90C09 PDF BibTeX XML Cite \textit{A. Freville} and \textit{G. Plateau}, Discrete Appl. Math. 49, No. 1--3, 189--212 (1994; Zbl 0802.90077) Full Text: DOI
Kennington, Jeffery L.; Mohammadi, Farin The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm. (English) Zbl 0802.90081 Comput. Optim. Appl. 3, No. 1, 7-26 (1994). MSC: 90C10 90C35 90-08 PDF BibTeX XML Cite \textit{J. L. Kennington} and \textit{F. Mohammadi}, Comput. Optim. Appl. 3, No. 1, 7--26 (1994; Zbl 0802.90081) Full Text: DOI
Adams, Warren P.; Dearing, P. M. On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems. (English) Zbl 0794.90038 Discrete Appl. Math. 48, No. 1, 1-20 (1994). MSC: 90C09 90C20 90C11 PDF BibTeX XML Cite \textit{W. P. Adams} and \textit{P. M. Dearing}, Discrete Appl. Math. 48, No. 1, 1--20 (1994; Zbl 0794.90038) Full Text: DOI
Johri, Pravin K. Implied constraints and a unified theory of duality in linear and nonlinear programming. (English) Zbl 0804.90090 Eur. J. Oper. Res. 71, No. 1, 61-69 (1993). MSC: 90C05 90C30 PDF BibTeX XML Cite \textit{P. K. Johri}, Eur. J. Oper. Res. 71, No. 1, 61--69 (1993; Zbl 0804.90090) Full Text: DOI
Adams, Warren P.; Sherali, Hanif D. Mixed-integer bilinear programming problems. (English) Zbl 0801.90085 Math. Program. 59, No. 3 (A), 279-305 (1993). Reviewer: H.T.Lau (Verdun / Quebec) MSC: 90C11 PDF BibTeX XML Cite \textit{W. P. Adams} and \textit{H. D. Sherali}, Math. Program. 59, No. 3 (A), 279--305 (1993; Zbl 0801.90085) Full Text: DOI
Karmarkar, Narendra; Resende, Mauricio G. C.; Ramakrishnan, K. G. An interior point algorithm to solve computationally difficult set covering problems. (English) Zbl 0753.90046 Math. Program., Ser. B 52, No. 3, 597-618 (1991). Reviewer: A.P.Bosznay (Budapest) MSC: 90C10 90-08 05C70 90C09 90C06 PDF BibTeX XML Cite \textit{N. Karmarkar} et al., Math. Program. 52, No. 3 (B), 597--618 (1991; Zbl 0753.90046) Full Text: DOI
Barceló, J.; Fernandez, E. Dual methods and hybrid algorithms for set partitioning problems. (Spanish. English summary) Zbl 0692.90071 Trab. Invest. Oper. 5, No. 1, 35-59 (1990). MSC: 90C10 65K05 PDF BibTeX XML Cite \textit{J. Barceló} and \textit{E. Fernandez}, Trab. Invest. Oper. 5, No. 1, 35--59 (1990; Zbl 0692.90071) Full Text: DOI
Feo, Thomas A.; Resende, Mauricio G. C. A probabilistic heuristic for a computationally difficult set covering problem. (English) Zbl 0675.90073 Oper. Res. Lett. 8, No. 2, 67-71 (1989). Reviewer: J.Terno MSC: 90C27 05C70 05B07 65K05 PDF BibTeX XML Cite \textit{T. A. Feo} and \textit{M. G. C. Resende}, Oper. Res. Lett. 8, No. 2, 67--71 (1989; Zbl 0675.90073) Full Text: DOI
Sarin, Sanjiv; Karwan, Mark H.; Rardin, Ronald L. Surrogate duality in a branch-and-bound procedure for integer programming. (English) Zbl 0638.90072 Eur. J. Oper. Res. 33, 326-333 (1988). MSC: 90C10 65K05 PDF BibTeX XML Cite \textit{S. Sarin} et al., Eur. J. Oper. Res. 33, 326--333 (1988; Zbl 0638.90072) Full Text: DOI
Boros, Endre On the complexity of the surrogate dual of 0-1 programming. (English) Zbl 0594.90061 Z. Oper. Res., Ser. A 30, 145-153 (1986). Reviewer: P.Brucker MSC: 90C10 68Q25 90C09 PDF BibTeX XML Cite \textit{E. Boros}, Z. Oper. Res., Ser. A 30, 145--153 (1986; Zbl 0594.90061) Full Text: DOI
Chang, Suk-Gwon; Tcha, Dong-Wan A heuristic for multiple choice programming. (English) Zbl 0618.90070 Comput. Oper. Res. 12, 25-37 (1985). MSC: 90C11 65K05 90C09 90C05 PDF BibTeX XML Cite \textit{S.-G. Chang} and \textit{D.-W. Tcha}, Comput. Oper. Res. 12, 25--37 (1985; Zbl 0618.90070) Full Text: DOI
Young, Ming Huei; Muroga, Saburo Minimal covering problem and PLA minimization. (English) Zbl 0599.94017 Int. J. Comput. Inform. Sci. 14, 337-364 (1985). MSC: 94C10 90C10 PDF BibTeX XML Cite \textit{M. H. Young} and \textit{S. Muroga}, Int. J. Comput. Inform. Sci. 14, 337--364 (1985; Zbl 0599.94017) Full Text: DOI
Gavish, Bezalel; Pirkul, Hasan Zero-one integer programs with few contraints - lower bounding theory. (English) Zbl 0569.90057 Eur. J. Oper. Res. 21, 213-224 (1985). MSC: 90C09 90C10 65K05 PDF BibTeX XML Cite \textit{B. Gavish} and \textit{H. Pirkul}, Eur. J. Oper. Res. 21, 213--224 (1985; Zbl 0569.90057) Full Text: DOI
Côté, Gilles; Laughton, Michael A. Large-scale mixed integer programming: Benders-type heuristics. (English) Zbl 0532.90077 Eur. J. Oper. Res. 16, 327-333 (1984). MSC: 90C11 90C90 65K05 90B10 PDF BibTeX XML Cite \textit{G. Côté} and \textit{M. A. Laughton}, Eur. J. Oper. Res. 16, 327--333 (1984; Zbl 0532.90077) Full Text: DOI
Bazaraa, Mokhtar S.; Sherali, Hanif D. A versatile scheme for ranking the extreme points of an assignmeent polytope. (English) Zbl 0535.90064 Nav. Res. Logist. Q. 28, 545-557 (1981). MSC: 90C09 65K05 52Bxx 90C05 PDF BibTeX XML Cite \textit{M. S. Bazaraa} and \textit{H. D. Sherali}, Nav. Res. Logist. Q. 28, 545--557 (1981; Zbl 0535.90064) Full Text: DOI
Wollmer, Richard D. Two stage linear programming under uncertainty with 0-1 integer first stage variables. (English) Zbl 0442.90076 Math. Program. 19, 279-288 (1980). MSC: 90C15 90C09 90C11 PDF BibTeX XML Cite \textit{R. D. Wollmer}, Math. Program. 19, 279--288 (1980; Zbl 0442.90076) Full Text: DOI
Avis, David A note on some computationally difficult set covering problems. (English) Zbl 0429.90047 Math. Program. 18, 138-145 (1980). MSC: 90C09 05B05 51E10 68Q25 65K05 PDF BibTeX XML Cite \textit{D. Avis}, Math. Program. 18, 138--145 (1980; Zbl 0429.90047) Full Text: DOI
Fisk, John C.; Hung, Ming S. A heuristic routine for solving large loading problems. (English) Zbl 0497.90044 Nav. Res. Logist. Q. 26, 643-650 (1979). MSC: 90C09 65K05 90C08 PDF BibTeX XML Cite \textit{J. C. Fisk} and \textit{M. S. Hung}, Nav. Res. Logist. Q. 26, 643--650 (1979; Zbl 0497.90044) Full Text: DOI
Jambekar, Anil B.; Steinberg, David I. Computational experience with an algorithm for 0-1 integer programming. (English) Zbl 0404.90056 Comput. Math. Appl. 4, 305-314 (1978). MSC: 90C09 65K05 PDF BibTeX XML Cite \textit{A. B. Jambekar} and \textit{D. I. Steinberg}, Comput. Math. Appl. 4, 305--314 (1978; Zbl 0404.90056) Full Text: DOI
Posner, Marc E.; Guignard, Monique The collapsing 0-1 knapsack problem. (English) Zbl 0393.90060 Math. Program. 15, 155-161 (1978). MSC: 90C09 65K05 68Q25 PDF BibTeX XML Cite \textit{M. E. Posner} and \textit{M. Guignard}, Math. Program. 15, 155--161 (1978; Zbl 0393.90060) Full Text: DOI
Soyster, A. L.; Lev, B.; Slivka, W. Zero-one programming with many variables and few constraints. (English) Zbl 0381.90076 Eur. J. Oper. Res. 2, 195-201 (1978). MSC: 90C10 65K05 PDF BibTeX XML Cite \textit{A. L. Soyster} et al., Eur. J. Oper. Res. 2, 195--201 (1978; Zbl 0381.90076) Full Text: DOI
Fox, B. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.; Schrage, L. E. Branching from the largest upper bound. Folklore and facts. (English) Zbl 0381.90075 Eur. J. Oper. Res. 2, 191-194 (1978). MSC: 90C10 PDF BibTeX XML Cite \textit{B. L. Fox} et al., Eur. J. Oper. Res. 2, 191--194 (1978; Zbl 0381.90075) Full Text: DOI
Jambekar, Anil B.; Steinberg, David I. An implicit enumeration algorithm for the all integer programming problem. (English) Zbl 0373.90051 Comput. Math. Appl. 4, 15-31 (1978). MSC: 90C10 PDF BibTeX XML Cite \textit{A. B. Jambekar} and \textit{D. I. Steinberg}, Comput. Math. Appl. 4, 15--31 (1978; Zbl 0373.90051) Full Text: DOI
Rödder, W. Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: LEXS. (German) Zbl 0333.90036 Z. Oper. Res., Ser. A 20, 209-217 (1976). MSC: 90C10 90B40 65K05 PDF BibTeX XML Cite \textit{W. Rödder}, Z. Oper. Res., Ser. A 20, 209--217 (1976; Zbl 0333.90036) Full Text: DOI
Fayard, D.; Plateau, G. Resolution of the O-1 knapsack problem: comparison of methods. (English) Zbl 0314.90062 Math. Program. 8, 272-307 (1975). MSC: 90C10 65K05 PDF BibTeX XML Cite \textit{D. Fayard} and \textit{G. Plateau}, Math. Program. 8, 272--307 (1975; Zbl 0314.90062) Full Text: DOI
Nemhauser, G. L.; Trotter, L. E. jun. Vertex packings: structural properties and algorithms. (English) Zbl 0314.90059 Math. Program. 8, 232-248 (1975). MSC: 90C10 52C17 90C35 PDF BibTeX XML Cite \textit{G. L. Nemhauser} and \textit{L. E. Trotter jun.}, Math. Program. 8, 232--248 (1975; Zbl 0314.90059) Full Text: DOI
Ross, G. Terry; Soland, Richard M. A branch and bound algorithm for the generalized assignment problem. (English) Zbl 0308.90028 Math. Program. 8, 91-103 (1975). MSC: 90C10 65K05 PDF BibTeX XML Cite \textit{G. T. Ross} and \textit{R. M. Soland}, Math. Program. 8, 91--103 (1975; Zbl 0308.90028) Full Text: DOI
Attmann, J.; Hahn, W. Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung. (German) Zbl 0305.65033 Computing 14, 261-270 (1975). MSC: 65K05 90C10 PDF BibTeX XML Cite \textit{J. Attmann} and \textit{W. Hahn}, Computing 14, 261--270 (1975; Zbl 0305.65033) Full Text: DOI
Ignizio, James P.; Harnett, R. M. Heuristically aided set-covering algorithms. (English) Zbl 0276.65037 Int. J. Comput. Inform. Sci. 3, 59-70 (1974). MSC: 65K05 68W99 90C10 PDF BibTeX XML Cite \textit{J. P. Ignizio} and \textit{R. M. Harnett}, Int. J. Comput. Inform. Sci. 3, 59--70 (1974; Zbl 0276.65037) Full Text: DOI
Gorry, G. Anthony; Northup, William D.; Shapiro, Jeremy F. Computational experience with a group theoretic integer programming algorithm. (English) Zbl 0256.90037 Math. Program. 4, 171-192 (1973). MSC: 90C10 65K05 PDF BibTeX XML Cite \textit{G. A. Gorry} et al., Math. Program. 4, 171--192 (1973; Zbl 0256.90037) Full Text: DOI
Hrouda, Jaroslav A contribution to Balas’ algorithm. (English) Zbl 0246.90032 Apl. Mat. 16, 336-353 (1971). MSC: 90C10 65K05 PDF BibTeX XML Cite \textit{J. Hrouda}, Apl. Mat. 16, 336--353 (1971; Zbl 0246.90032) Full Text: EuDML
Balas, Egon A duality theorem and an algorithm for (mixed-) integer nonlinear programming. (English) Zbl 0225.90032 Linear Algebra Appl. 4, 341-352 (1971). MSC: 90C11 PDF BibTeX XML Cite \textit{E. Balas}, Linear Algebra Appl. 4, 341--352 (1971; Zbl 0225.90032) Full Text: DOI