Foundation-penalty cuts for mixed-integer programs

Operations Research Letters

Volumn 31, Issue 4, 2003, Pages 245-253

  Glover, Fred ^a   Sherali, Hanif D ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

B B penalties; Cutting planes; Mixed integer programming

Indexed keywords

CONSTRAINT THEORY; FUNCTIONS; INTEGER PROGRAMMING; OPTIMIZATION;

MIXED-INTEGER PROGRAMMING (MIP); PENALTY CALCULATIONS;

OPERATIONS RESEARCH;

EID: 0037566336     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00014-2     Document Type: Article

References (27)

1. D. Applegate, R. Bixby, W. Cook, V. Chvatal, Personal Communication, in: J.T. Linderoth, M.W.P. Savelsbergh (Eds.), A computational study of search strategies for mixed integer programming, INFORMS Comput. 11 (1999) 173-187.
2. Balas E. Disjunctive programming. Ann. Discrete Math. 5:1979;3-51.
3. Balas E. Disjunctive programming. properties of the convex hull of feasible points Discrete Appl. Math. 89(1-2):1998;3-44.
4. Balas E., Ceria S., Cornuejols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58:1993;295-324.
5. Balas E., Zemel E. Facets of the knapsack polytope from minimal covers. SIAM J. Appl. Math. 34:1975;119-148.
6. Crowder H., Johnson E.L., Padberg M.W. Solving large-scale zero-one linear programming problems. Oper. Res. 31:1983;803-834.
7. Glover F. Faces of the Gomory polyhedron. Abadie Jean Integer and Nonlinear Programming II. 1970;North-Holland, Amsterdam.
8. Glover F. Convexity cuts for multiple choice problems. Discrete Math. 3(1):1973;86-100.
9. Glover F. Polyhedral annexation in mixed integer and combinatorial programming. Math. Program. 8:1975;161-188.
10. Glover F., Sherali H.D., Lee Y. Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming. Comput. Optim. Appl. 8(2):1997;151-172.
11. Gomory R.E. Solving linear programming problems in integers. Bellman R.E., Hall M. Jr. Combinatorial Analysis, American Mathematical Society. 1960;211-216.
12. Gomory R.E. An Algorithm for the Mixed Integer Problem, Research Memorandum RM-2597. 1960;Rand Corporation, Santa Monica.
13. Gomory R.E. Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2:1969;451-558.
14. Z. Gu, G.L. Nemhauser, M.W.P. Savelsbergh, Sequence Independent Lifting, Working paper, Georgia Institute of Technology, Atlanta, GA, 1995.
15. Gu Z., Nemhauser G.L., Savelsbergh M.W.P. Lifted flow covers for mixed 0-1 integer programs. Math. Program. 85:1999;439-468.
16. Hammer P.L., Johnson E.L., Peled U.N. Facets of regular 0-1 polytopes. Math. Program. 8:1975;179-206.
17. Jeroslow R.G. Cutting plane theory. disjunctive methods Ann. Discrete Math. 1:1977;293-330.
18. Marchand H., Wolsey L.A. Aggregation and mixed integer rounding to solve MIPS. Oper. Res. 49(3):2001;363-371.
19. Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization. 2001;Wiley, Inc. New York, NY.
20. Padberg M.W. On the facial structure of set packing polyhedra. Math. Program. 5:1973;199-215.
21. Rardin R., Karwan M.H. Surrogate dual multiplier search procedures in integer programming. Oper. Res. 32:1984;52-69.
22. Sherali H.D., Adams W.P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3):1990;411-430.
23. Sherali H.D., Adams W.P. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52:1994;83-106.
24. Sherali H.D., Adams W.P., Driscoll P.J. Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems. Oper. Res. 46(3):1998;396-405.
25. Sherali H.D., Lee Y. Sequential and simultaneous liftings of minimal cover inequalities for generalized upper bound constrained knapsack polytopes. SIAM J. Discrete Math. 8(1):1995;133-153.
26. Sherali H.D., Lee Y., Adams W.P. A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope. Oper. Res. Lett. 17(1):1995;19-26.
27. H.D. Sherali, C.M. Shetty, Optimization with Disjunctive Constraints, Series in Economics and Mathematical Systems, Vol. 181, Springer, Berlin, Heidelberg, New York, 1980.