Disjunctive programming

50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art

Volumn , Issue , 2010, Pages 283-340

  Balas, Egon ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84875442831     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-68279-0_10     Document Type: Chapter

References (67)

1. A. Atamtürk, Strong formulations of robust mixed 0-1 programming, Mathematical Programming 108 (2006) 235-250.
2. K. Andersen, Q. Louveaux, R. Weismantel and L.A. Wolsey, Inequalities from two rows of the simplex tableau, Integer Programming and Combinatorial Optimization IPCO 12 (M. Fischetti and D.P. Williamson, eds.), Springer, 2007, pp. 1-16.
3. E. Balas, An additive algorithm for solving linear programs in 0-1 variables, Operations Research 13 (1965) 517-546.
4. E. Balas, Disjunctive programming and a hierarchy of relaxations for discrete optimization problems, SIAM Journal on Algebraic and Discrete Methods 6 (1985) 466-486.
5. E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, Invited paper with a Foreword by G. Cornuéjols and G. Pulleyblank, Discrete Applied Mathematics 89 (1998) 1-44.
6. E. Balas and P. Bonami, New variants of lift-and-project cut generation from the LP tableau: Open source implementation and testing, Integer Programming and Combinatorial Oprtimization IPCO 12 (M. Fischetti and D.P. Williamson, eds.), Springer, 2007, pp. 89-103.
7. V. Borozan and G. Cornuéjols, Minimal inequalities for integer constraints, Technical Report, Tepper School, Carnegie Mellon University, 2007.
8. E. Balas, S. Ceria and G. Cornuéjols, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Mathematical Programming 58 (1993) 295-324.
9. E. Balas, S. Ceria, G. Cornuéjols and N. Natraj, Gomory cuts revisited, Operations Research Letters 19 (1996) 1-10.
10. M. Ball, W. Liu and W.R. Pulleyblank, Two-terminal Steiner tree polyhedra, Contributions to Operations Research and Economics, MIT Press, 1989, pp. 251-284.
11. E. Balas and W.R. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13 (1983) 495-516.
12. E. Balas and W.R. Pulleyblank, The perfectly matchable subgraph polytope of an arbitrary graph, Combinatorica 9 (1989) 321-337.
13. E. Balas and M. Perregaard, A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming, Mathematical Programming 94 (2003) 221-245.
14. G. Cornuéjols and F. Margot, On the facets of mixed integer programs with two integer variables and two constraints, Technical Report, Tepper School, Carnegie Mellon University, 2007.
15. http://www.coin-or.org
16. M. Conforti and L.A. Wolsey, Compact formulations as a union of polyhedra, Mathematical Programming 114 (2008) 277-289.
17. S.S. Dey and L.A. Wolsey, Lifting integer variables in minimal inequalities corresponding to lattice-free triangles, Integer Programming and Combinatorial Optimization IPCO 13 (A. Lodi, A. Panconesi, and G. Rinaldi, eds.), Springer, 2008, pp. 463-475.
18. L. Lovász and A. Schrijver, Cones of matrices and set functions and 0-1 optimization, SIAM Journal of Optimization 1 (1991) 166-190.
19. M. Perregaard, A Practical implementation of lift-and-project cuts: a computational exploration of lift-and-project with XPRESS-MP, International Symposium on Mathematical Programming, Copenhagen, August 2003.
20. Y. Pochet and L.A. Wolsey, Production Planning by Mixed Integer Programming, Springer, 2006.
21. R. Stubbs and S. Mehrotra, A branch and cut method for 0-1 mixed integer convex programming, Mathematical Programming 86 (1999) 515-532.
22. J. A. Araoz Durand, Polyhedral neopolarities, Ph.D. Dissertation, University of Waterloo (November 1973).
23. E. Balas, Intersection cuts - A new type of cutting planes for integer programming, Operations Res. 19 (1971) 19-39.
24. E. Balas, Integer programming and convex analysis: Intersection cuts from outer polars, Math. Programming 2 (1972) 330-382.
25. E. Balas, Ranking the facets of the octahedron, Discrete Math. 2 (1972) 1-15.
26. E. Balas, Nonconvex quadratic programming via generalized polars, SIAM J. Appl. Math. 28 (1975) 335-349.
27. E. Balas, A constraint-activating outer polar method for pure and mixed integer 0-1 programs, In: P. L. Hammer and G. T. Zoutendijk, eds., Mathematical Programming in Theory and Practice, (North-Holland, Amsterdam, 1974 275-310.
28. E. Balas, On the use of intersection cuts in branch and bound. Paper presented at the 8th International Symposium on Mathematical Programming, Stanford, CA (August 27-31, 1973).
29. E. Balas, Intersection cuts from disjunctive constraints, MSRR No. 330, Carnegie-Mellon University, First draft (August 1973); Revised and expanded (February 1974).
30. E. Balas, Disjunctive programming: Cutting planes from logical conditions, In: O. L. Mangasarian, R. R. Meyer and S. M. Robinson, eds., Nonlinear Programming 2 (Academic Press, New York, 1975) 279-312.
31. E. Balas, Disjunctive programming: Properties of the convex hull of feasible points, MSSR No. 348, Carnegie-Mellon University (July 1974).
32. E. Balas, A Note on duality in disjunctive programming, J. Optimization Theory Appl. 15 (1977).
33. E. Balas, Set covering with cutting planes from conditional bounds, MSRR No. 399. Carnegie-Mellon University (July 1976).
34. E. Balas, V. J. Bowman, F. Glover and D. Sommer, An intersection cut from the dual of the unit hypercube, Operations Res. 19 (1971) 40-44.
35. E. Balas and R. Jeroslow, Strengthening cuts for mixed integer programs, MSRR No. 359, Carnegie-Mellon University (February 1975).
36. E. Balas and A. Zoltners, Intersection cuts from outer polars of truncated cubes, Naval Res. Logist. Quart. 22 (1975) 477-496.
37. M. Bellmore and H.D. Ratliff, Set covering and involutory bases, Management Sci. 18 (1971) 194-206.
38. CE. Blair and R.G. Jeroslow, A converse for disjunctive constraints, MSRR No. 393, Carnegie-Mellon University (June 1976).
39. J. Borwein, A strong duality theory for the minimum of a family of convex programs, Dalhousie University, Halifax (June 1978).
40. CA. Burdet, Enumerative inequalities in integer programming, Math. Programming 2 (1972) 32-64.
41. CA. Burdet, Polaroids: A new tool in nonconvex and integer programming, Naval Res. Logist. Quart. 20 (1973) 13-24.
42. D.R. Fulkerson, Blocking Polyhedra, in: B. Harris, ed., Graph Theory and Its Applications (Academic Press, New York, 1972) 93-112.
43. D.R. Fulkerson, Anti-blocking polyhedra, J. Combinatorial Theory 12 (1972) 50-71.
44. D.R. Fulkerson, Blocking and anti-blocking pairs of polyhedra, Math. Programming 1 (1971) 168-194.
45. F. Glover, Convexity cuts and cut search, Operations Res. 21 (1973) 123-134.
46. F. Glover, Convexity cuts for multiple choice problems, Discrete Math. 6 (1973) 221-234.
47. F. Glover, Polyhedral annexation in mixed integer programming. MSRS 73-9, University of Colorado (August 1973).
48. Revised and published as: Polyhedral annexation in mixed integer and combinatorial programming, Math. Programming 9 (1975) 161-188.
49. F. Glover and D. Klingman, The generalized lattice point problem, Operations Res. 21 (1973) 141-156.
50. F. Glover, D. Klingman and J. Stutz, The disjunctive facet problem: formulation and solution techniques, Operations Res. 22 (1974) 582-601.
51. J.J. Greenberg and W.P. Pierskalla, Stability theorems for infinitely constrained mathematical programs, J. Optimization Theory Appl. 16 (1975) 409-428.
52. B. Grünbaum, Convex Polytopes (J. Wiley, New York, 1967).
53. Hoang Tuy, Concave programming under linear constraints (Russian), Doklady Akademii Narck SSSR (1964).
54. English translation in Soviet Math. Dokl. (1964) 1437-1440.
55. R.G. Jeroslow, The principles of cutting plane theory: part I, Carnegie-Mellon University (February 1974).
56. R.G. Jeroslow, Cutting planes for relaxations of integer programs, MSRR No. 347, Carnegie-Mellon University (July 1974).
57. R.G. Jeroslow, Cutting plane theory: Disjunctive methods, Ann. Discrete Math., Vol. 1: Studies in Integer Programming, (1977) 293-330.
58. R.G. Jeroslow, Cutting planes for complementarity constraints, SIAM J. Control 16 (1978).
59. R.G. Jeroslow, A cutting plane game and its algorithms, CORE Discussion Paper 7724 (June 1977).
60. E.L. Johnson, The group problem for mixed integer programming, Math. Programming Study 2 (1974) 137-179.
61. G. Owen, Cutting planes for programs with disjunctive constraints, J. Optimization Theory Appl. 11(1973)49-55.
62. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, N.J, 1970).
63. J. Stoer and C. Witzgall, Convexity and Optimization in Finite Dimensions I (Springer, Berlin, 1970).
64. J. Tind, Blocking and anti-blocking sets, Math. Programming 6 (1974) 157-166.
65. R.D. Young, Hypercylindrically deduced cuts in zero-one integer programs, Operations Res. 19 (1971) 1393-1405.
66. E. Zemel, On the facial structure of 0-1 polytopes, Ph.D. Dissertation, GSIA, Carnegie-Mellon University (May 1976).
67. P. Zwart, Intersection cuts for separable programming, Washington University, St. Louis (January 1972).