Facets of the Complementarity Knapsack Polytope

References

• Balas E. Facets of the knapsack polytope. Math. Programming (1975) 8:146–164Crossref, Google Scholar
• Beale E. L. M., Barrit M. M., Wishart D. Branch-and-bound methods for numerical optimization. COMPSTAT 80: Proc. Comput. Statist. (1980) (Physica Verlag)11–20Google Scholar
• Beale E. L. M., Tomlin J. A., Lawrence J. Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. Proc. Fifth Internat. Conf. (1970) (O.R. Tavistock Publications)447–454Google Scholar
• Beaumont N. An algorithm for disjunctive programming. Eur. J. Oper. Res. (1990) 48:362–371Crossref, Google Scholar
• Bienstock D. Computational study of a family of mixed-integer quadratic programming problems. Math. Programming (1996) 74:121–140Crossref, Google Scholar
• Cottle R. W., Pang J. S., Stone R. E.The Linear Complementarity Problem (1992) (Academic Press, New York) Google Scholar
• Dantzig G. B. On the significance of solving linear programming problems with some integer variables. Econometrica (1960) 28:30–44Crossref, Google Scholar
• de Farias I. R. A polyhedral approach to combinatorial complementarity programming problems. (1995) . Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
• de Farias I. R. A family of facets for the uncapacitated p-median polytope. Oper. Res. Lett. (2001) 28:161–167Crossref, Google Scholar
• de Farias I. R., Nemhauser G. L. A family of inequalities for the generalized assignment polytope. Oper. Res. Lett. (2001) 29:49–51Crossref, Google Scholar
• de Farias I. R., Nemhauser G. L. A polyhedral study of the cardinality constrained knapsack problem. (2001a) . Core preprint. Technical paper TL1-01-05, Georgia Institute of Technology, Atlanta, GAGoogle Scholar
• de Farias I. R., Johnson E. L., Nemhauser G. L. A generalized assignment problem with special ordered sets: A polyhedral approach. Math. Programming (2000) 89:187–203Crossref, Google Scholar
• de Farias I. R., Johnson E. L., Nemhauser G. L. Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowledge Engrg. Rev. (2001) 16:25–39Google Scholar
• Hammer P. L., Johnson E. L., Peled U. N. Facets of regular 0-1 polytopes. Math. Programming (1975) 8:179–206Crossref, Google Scholar
• Hooker J. N., Osorio M. A. Mixed logical-linear programming. Discrete Appl. Math. (1999) 96:395–442Crossref, Google Scholar
• Hooker J. N., Ottosson G., Thorsteinsson E. S., Kim H. J. A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engrg. Rev. (2000) 15:11–30Crossref, Google Scholar
• Ibaraki T. Approximate algorithms for the multiple-choice continuous knapsack problem. J. Oper. Res. Soc. Japan (1980) 23:28–62Google Scholar
• Ibaraki T., Hasegawa T., Teranaka K., Iwase J. The multiple-choice knapsack problem. J. Oper. Res. Soc. Japan (1978) 21:59–94Google Scholar
• Johnson E. L., Padberg M. W. A note on the knapsack problem with special ordered sets. Oper. Res. Lett. (1981) 1:18–22Crossref, Google Scholar
• Perold A. F. Large-scale portfolio optimization. Management Sci. (1984) 30:1143–1160Link, Google Scholar
• van Hentenryck P.Constraint Satisfaction in Logic Programming (1988) (MIT Press, Boston, MA) Google Scholar
• van Hentenryck P.The OPL Optimization Programming Language (1999) (MIT Press, Boston, MA) Google Scholar
• Wolsey L. A. Faces for a linear inequality in 0–1 variables. Math. Programming (1975) 8:165–178Crossref, Google Scholar
• Wolsey L. A. Facets and strong valid inequalities for integer programs. Oper. Res. (1976) 24:367–372Link, Google Scholar
• Wolsey L. A. Valid inequalities for 0–1 knapsacks and MIPs with generalized upper bound constraints. Discrete Appl. Math. (1990) 29:251–261Crossref, Google Scholar