Valid inequalities based on simple mixed-integer sets

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

Volumn 3064, Issue , 2004, Pages 33-45

  Dash, Sanjeeb ^a   Günlük, Oktay ^a  

^a IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

CONVEX HULL; CYCLIC GROUP; MIXED-INTEGER SETS; SINGLE EQUATION; VALID INEQUALITY;

INTEGER PROGRAMMING;

EID: 35048856918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25960-2_3     Document Type: Article

References (19)

1. K. Aardal, R. Weismantel, and L.A. Wolsey, Non-standard approaches to integer programming, Discrete Applied Mathematics 123 5-74 (2002).
2. A. Agra and M. F. Constantino, Description of 2-integer continuous knapsack polyhedra, working paper (2003).
3. J. Araoz, R.E. Gomory, E.L. Johnson, and L. Evans, Cyclic group and knapsack facets, Mathematical Programming 96 377-408 (2003).
4. E. Balas, S. Ceria, G. Cornuéjols, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Mathematical Programming 58 295-324 (1993).
5. E. Balas, S. Ceria, G. Cornuéjols, G. Natraj, Gomory cuts revisited, Operations Research Letters 19 1-9 (1996).
6. R. E. Bixby, M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling. MIP: Theory and practice - closing the gap. In M. J. D. Powell and S. Scholtes, editors, System Modelling and Optimization: Methods, Theory, and Applications, pages 19-49. Kluwer Academic Publishers, 2000.
7. G. Cornuejols, Y. Li and D. Vandenbussche, K-Cuts: A variation of Gomory mixed integer cuts from the LP tableau, To appear in INFORMS Journal on Computing.
8. S. Dash and O. Günlük,Valid Inequalities Based on Simple Mixed-Interger Sets, IBM Research Report RC22922 (2003).
9. S. Dash and O. Günlük, Comparing valid inequalities for cyclic group polyhedra, IBM Research Report RC22989 (2003).
10. L. Evans, Cyclic groups and knapsack facets with applications to cutting planes, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, Georgia, 2002.
11. R.E. Gomory, Some polyhedra related to combinatorial problems, Journal of Linear Algebra and its Applications, 2, 451-558 (1969).
12. R.E. Gomory and E. Johnson, Some continuous functions related to corner polyhedra I, Mathematical Programming 3 23-85 (1972).
13. R.E. Gomory and E. Johnson, Some continuous functions related to comer polyhedra II, Mathematical Programming 3 359-389 (1972).
14. R.E. Gomory and E. Johnson, T-space and cutting planes, Mathematical Programming 96 341-375 (2003).
15. R.E. Gomory, E.L. Johnson, and L. Evans, Corner Polyhedra and their connection with cutting planes, Mathematical Programming 96 321-339 (2003).
16. A. N. Letchford and A. Lodi, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts, Operations Research Letters 30(2) 74-82 (2002).
17. T.L. Magnanti, P. Mirchandani, and R. Vachani, The convex hull of two core capacitated network design problems, Math. Programming 60, 233-250 (1993).
18. H. Marchand and L. Wolsey, Aggregation and mixed integer rounding to solve MIPs, Oper. Res. 49, 363-371 (2001).
19. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York (1988).