Solving integer and disjunctive programs by lift and project

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1412, Issue , 1998, Pages 271-283

  Ceria, Sebastián ^a   Pataki, Gábor ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

BRANCH AND CUT; DISJUNCTIVE CONSTRAINTS; LIFT-AND-PROJECT; MIXED-INTEGER PROGRAMS; THEORETICAL FOUNDATIONS;

INTEGER PROGRAMMING;

EID: 84958754907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_21     Document Type: Conference Paper

References (26)

1. P. Avella and F. Rossi. Private communication.
2. G. Astfalk and R. Bixby. Private communication.
3. E. Balas. Intersection cuts - A new type of cutting planes for integer programming. Operations Research, 19:19-39, 1971.
4. E. Balas. Disjunctive programming: Facets of the convex hull of feasible points. Technical Report No. 348, GSIA, Carnegie Mellon University, 1974.
5. E. Balas. Disjunctive programming. Annals of Discrete Mathematics, 5:3-51, 1979.
6. E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Alg. Disc. Meth., 6:466-486, 1985.
7. E. Balas. Enhancements of lift-and-project. Technical Report, GSIA, Carnegie Mel- lon University, 1997.
8. E. Balas, S. Ceria, and G. Cornuejols. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming, 58:295-324, 1993.
9. E. Balas, S. Ceria, and G. Cornuéjols. Mixed 0-1 Programming by lift-ad-project in a branch-and-cut framework. Management Science, 42:1229-1246, 1996.
10. E. Balas, S. Ceria, G. Cornuéjols, and G. Pataki. Polyhedral Methods for the Maximum Clique Problem. AMS, DIMACS Series on Discrete Mathematics and Computer Science, 26:11-28, 1996.
11. N. Beaumont. An algorithm for disjunctive programs. European Journal of Operational Research, 48:362-371, 1990.
12. C. Blair. Two rules for deducing valid inequalities for 0-1 problems. SIAM Journal of Applied Mathematics, 31:614-617, 1976.
13. S. Ceria and J. Soares. Disjunctive cuts for mixed 0-1 programming: Duality and lifting. Working paper, Graduate School of Business, Columbia University, 1997.
14. S. Ceria and J. Soares. Convex programming for disjunctive optimization. Working paper, Graduate School of Business, Columbia University, 1997.
15. J. Hooker. Logic based methods for optimization. In A. Borning, editor, Principles and practice of constraint programming, LNCS, Vol. 626, pages 184-200, 1992.
16. J. Hooker, M. Osorio. Mixed logical/linear programming. Technical report, GSIA, Carnegie Mellon University, 1997.
17. J. Hooker, H. Yan, I. Grossman, and R. Raman. Logic cuts for processing networks with fixed charges. Computers and Operations Research, 21:265-279, 1994.
18. R. Jeroslow. Representability in mixed-integer programming I: Characterization results. Discrete Applied Mathematics, 17:223-243, 1987.
19. R. Jeroslow. Logic based decision support: Mixed-integer model formulation. Annals of Discrete Mathematics, 40, 1989.
20. L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization, 1:166-190, 1991.
21. R. Meyer. Integer and mixed-integer programming models: General properties. Journal of Optimization Theory and Applications, 16:191-206, 1975.
22. H. Sherali and W. Adams. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Disc. Math., 3:411-430, 1990.
23. H. Sherali and C. Shetty. Optimization with disjunctive constraints, In M. Beckman and H. Kunzi, editors, Lecture notes in Economics and Mathematical Systems, Vol. 181. Springer-Verlag, 1980.
24. J. Soares. Disjunctive Methods for Discrete Optimization Problems, PhD thesis, Graduate School of Business, Columbia University, 1997. In preparation.
25. H. P. Williams. An alternative explanation of disjunctive formulations. European Journal of Operational Research, 72:200-203, 1994.
26. L. Wolsey. Private communication.