A polyhedral study of the cardinality constrained knapsack problem

Mathematical Programming

Volumn 96, Issue 3, 2003, Pages 439-467

  De Farias Jr , I R ^a   Nemhauser, G L ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b Georgia Institute of Technology   (United States)

Author keywords

Branch and cut; Cardinality constrained programming; Knapsack problem; Mixed integer programming

Indexed keywords

0-1 PROGRAMMING; ALTERNATIVE APPROACH; BRANCH-AND-CUT; CARDINALITIES; CARDINALITY CONSTRAINTS; COMPUTATIONAL RESULTS; CONTINUOUS VARIABLES; CONVEX HULL; FACET-DEFINING INEQUALITIES; FEASIBLE SET; KNAPSACK PROBLEMS; MIXED-INTEGER PROGRAMMING; NON-TRIVIAL; POLYHEDRAL STUDIES; VALID INEQUALITY;

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING;

INTEGER PROGRAMMING;

EID: 14944345436     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-003-0420-8     Document Type: Article

References (49)

1. Balas, E.: Facets of the knapsack polytope. Math. Program. 8, 146-164 (1975)
2. Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3-51 (1979)
3. Balas, E.: On the facial structure of scheduling polyhedra. Math. Program. Study 24, 179-218 (1985)
4. Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89, 3-44 (1998) (Pubitemid 128400151)
5. Balas, E., Ceria, S., Cornuéjols, G., Natraj, N.: Gomory Cuts Revisited. Oper. Res. Lett. 19, 1-9 (1996) (Pubitemid 126376719)
6. Beale, E.L.M.: Integer Programming. In: K. Schittkowski (Ed.), Computational Mathematical Programming, NATO ASI Series, Vol. F15, Springer-Verlag, 1985, pp. 1-24
7. Beale, E.L.M.,Tomlin, J.A.: Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: J. Lawrence (Ed.), Proceedings of the Fifth International Conference on Operations Research, Tavistock Publications, 1970, pp. 447-454
8. Biegler, L.T., Grossmann, I.E., Westerberg, A.W.: Systematic Methods of Chemical Process Design. Prentice Hall, 1997
9. Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74, 121-140 (1996) (Pubitemid 126407431)
10. Chandru, V., Hooker, J.N.: Optimization methods for logical inference. JohnWiley and Sons, 1999
11. Crowder, H., Johnson, E.L., Padberg, M.W.: Solving large scale zero-one problems. Oper. Res. 31, 803-834 (1983)
12. Dantzig, G.B.: On the significance of solving linear programming problems with some integer variables. Econometrica 28, 30-44 (1960)
13. de Farias, Jr., I.R.:A Polyhedral Approach to Combinatorial Complementarity Programming Problems. Ph.D. Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1995
14. de Farias, Jr., I.R.: A family of facets for the uncapacitated p-median polytope. Oper. Res. Lett. 28, 161-167 (2001) (Pubitemid 32610337)
15. de Farias, Jr., I.R., Johnson, E.L., Nemhauser, G.L.: A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. 89, 187-203 (2000)
16. de Farias, Jr., I.R., Johnson, E.L., Nemhauser, G.L.: Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowledge Eng. Rev. 16, 25-39 (2001) (Pubitemid 33691668)
17. de Farias, Jr., I.R., Johnson, E.L., Nemhauser, G.L.: Facets of the complementarity knapsack polytope. Math. Oper. Res. 27, 210-226 (2002) (Pubitemid 34254975)
18. de Farias, Jr. I.R., Nemhauser, G.L.: A family of inequalities for the generalized assignment polytope. Oper. Res. Lett. 29, 49-51 (2001)
19. de Farias, Jr. I.R., Nemhauser, G.L.:A polyhedral study of the cardinality constrained knapsack problem. In: W.J. Cook and A.S. Schulz (Eds.), Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 2337, Springer, 2002, pp. 291-303
20. Garey, M.R., Johnson, D.S.: Computers and Intractability:A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979
21. Grossmann, I.E., Hooker, J.N.: Logic Based Approaches for Mixed Integer Programming Models and their Application in Process Synthesis. in M.F. Malone et al. (Eds.), Proceedings of the Fifth FOCAPD Conference. AICHE Symposium Series 96, No. 232, 2000, pp. 70-83
22. Grötschel, M., Jünger, M., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Oper. Res. 32, 1195-1220 (1984) (Pubitemid 15457477)
23. Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Program. 85, 439-467 (1999)
24. Hammer, P.L., Johnson, E.L., Peled, U.N.: Facets of Regular 0-1 Polytopes. Math. Program. 8, 179-206 (1975)
25. Hoffman, K., Padberg, M.W.: LP-Based combinatorial problem solving. Ann. Oper. Res. 4, 145-194 (1985)
26. Hooker, J.N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. JohnWiley and Sons, 2000
27. Hooker, J.N.: Integrating Solution Methods for Optimization and Constraint Satisfaction Problems. Working Paper, Graduate School of Industrial Administration, Carnegie Mellon University, 2001
28. Hooker, J.N.: Logic, Optimization, and Constraint Programming. To appear in INFORMS Journal on Computing
29. Hooker, J.N., Osorio, M.A.: Mixed Logical/Linear Programming. Discrete Appl. Math. 96/97, 395-442 (1999)
30. Hooker, J.N., Ottosson, G., Thorsteinsson, E.S., Kim, H.-J.: On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization. Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99). MIT Press, 1999, pp. 136-141
31. Hooker, J.N., Ottosson, G., Thorsteinsson, E.S., Kim, H.-J.: A scheme for unifying optimization and constraint satisfaction methods. Knowledge Eng. Rev. 15, 11-30 (2000)
32. Jain, V., Grossmann, I.E.: Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS J. Comput. 4, 258-276 (2001) (Pubitemid 33645944)
33. Laundy, R.S.: Some Logically Constrained Mathematical Programming Problems. Ph.D. Thesis, University of Southampton, Southampton, UK, 1983
34. Marchand, H., Martin, A., Weismantel, R., Wolsey, L.A.: Cutting planes in integer and mixed-integer programming. Discrete Appl. Math. 123, 397-446 (1999)
35. Markowitz, H.M., Manne, A.S.: On the solution of discrete programming problems. Econometrica 25, 84-110 (1957)
36. Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.C.: MINTO, a Mixed-INTeger Optimizer. Oper. Res. Lett. 15, 47-58 (1994)
37. Nemhauser, G.L.,Wolsey, L.A.: Integer Programming and Combinatorial Optimization. JohnWiley and Sons, 1988
38. Ottosson, G., Thorsteinsson, E.S., Hooker, J.N.: Mixed global constraints and inference in Hybrid CLP-IP solvers. Ann. Math. Art. Intelli. 34, 271-290 (2002) (Pubitemid 37132995)
39. Padberg, M.W.: A Note on Zero-One Programming. Oper. Res. 23, 883-837 (1975)
40. Padberg, M.W., Rinaldi, G.: Optimization of a 532-City symmetric traveling salesman problem by branch-and-Cut. Oper. Res. Lett. 6, 1-7 (1987) (Pubitemid 17601864)
41. Perold, A.F.: Large-Scale portfolio optimization. Mgmt. Sci. 30, 1143-1160 (1984)
42. Queyranne, M.: Structure of a Simple Scheduling Polyhedron. Math. Program. 58, 263-285 (1993)
43. Raman R., Grossmann, I.E.: Symbolic Integration of Logic in MILP Branch-and-Bound Methods for the Synthesis of Process Networks. Ann. Oper. Res. 42, 169-191 (1993)
44. Thorsteinsson, E.S.: Branch-and-Check:A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming. In: T.Walsh (Ed.), Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, Lecture Notes of Computer Science 2239, Springer, 2001, pp. 16-30 (Pubitemid 33371064)
45. van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press, 1989
46. van Roy, T.J.,Wolsey, L.A.: Solving mixed-integer programming problems using automatic reformulation. Oper. Res. 35, 45-57 (1987)
47. Wolsey, L.A.: Faces for a Linear Inequality in 0-1 Variables. Math. Program. 8, 165-178 (1975)
48. Wolsey, L.A.: Facets and strong valid inequalities for integer programs. Oper. Res. 24, 367-372 (1976)
49. Wolsey, L.A.: Integer Programming. JohnWiley and Sons, 1998