Minimal valid inequalities for integer constraints

Mathematics of Operations Research

Volumn 34, Issue 3, 2009, Pages 538-546

  Borozan, Valentin ^a   Cornuéjols, Gérard ^b  

^a AIX MARSEILLE UNIV   (France)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Corner polyhedron; Integer programming; Lattice free convex set

Indexed keywords

CONVEX FUNCTIONS; CONVEX SET; CORNER POLYHEDRON; INTEGER CONSTRAINTS; LATTICE-FREE CONVEX SET; MIXED INTEGER LINEAR PROGRAM; PIECEWISE LINEAR; SEMI-INFINITE; VALID INEQUALITY;

DYNAMIC PROGRAMMING; PIECEWISE LINEAR TECHNIQUES; SET THEORY;

INTEGER PROGRAMMING;

EID: 70349266692     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0370     Document Type: Article

References (20)

1. Andersen, K., Q. Louveaux, R. Weismantel, L. Wolsey. 2007. Cutting planes from two rows of a simplex tableau. Integer Programming Combinat. Optim. Conf. XII, Ithaca, NY. Springer, New York, 1-15.
2. Balas, E. 1971. Intersection cuts-A new type of cutting planes for integer programming. Oper. Res. 19 19-39.
3. Basu, A., P. Bonami, G. Cornuéjols, F. Margot. 2008. On the relative strength of split, triangle and quadrilateral cuts. Working Paper E-38, Tepper School of Business, Carnegie Mellon University, Pittsburgh.
4. Basu, A., M. Conforti, G. Cornuéjols, G. Zambelli. 2009. Maximal lattice-free convex subsets of linear spaces. Math Oper. Res. Forthcoming.
5. Bell, D. E. 1977. A theorem concerning the integer lattice. Stud. Appl. Math. 56 187-188.
6. Cook, W., R. Kannan, A. Schrijver. 1990. Chvátal closures for mixed integer programming problems. Math. Programming 47 155-174.
7. Cornuéjols, G., F. Margot. 2008. On the facets of mixed integer programs with two integer variables and two constraints. Math. Programming (published online May 2008), http://dx.doi.org/10.1007/s10107-008-0221-1.
8. Dey, S. S., J.-P. P. Richard. 2008. Facets for the two-dimensional infinite group problems. Math. Oper. Res. 33 140-166.
9. Dey, S. S., L. A. Wolsey. 2008. Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. Integer Programming Combinat. Optim. XIII, Bertinoro, Italy. Springer, New York, 463-475.
10. Doignon, J.-P. 1973. Convexity in cristallographical lattices. J. Geometry 3 71-85.
11. Espinoza, D. 2008. Computing with multi-row Gomory cuts. Integer Programming Combinat. Optim. XIII, Bertinoro, Italy. Springer, New York, 214-224.
12. Gomory, R. E. 1963. An algorithm for integer solutions to linear programs. R. L. Graves, P. Wolfe, eds. Recent Advances in Mathematical Programming. McGraw-Hill, New York, 269-302.
13. Gomory, R. G. 1969. Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2 451-558.
14. Gomory, R. E. 2007. Thoughts about integer programming. 50th Anniversary Sympos. OR, University of Montreal, Quebec, and Corner polyhedra and two-equation cutting planes. George Nemhauser Sympos., Atlanta.
15. Gomory, R. E., E. L. Johnson. 1972. Some continuous functions related to corner polyhedra, Part I. Math. Programming 3 23-85.
16. Lovász, L. 1989. Geometry of numbers and integer programming. M. Iri, K. Tanabe, eds. Mathematical Programming: Recent Developments and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands, 177-201.
17. Marchand, H., L. A. Wolsey. 2001. Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49 363-371.
18. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. John Wiley and Sons, New York.
19. Scarf, H. E. 1977. An observation on the structure of production sets with indivisibilities. Proc. National Acad. Sci. 74 3637-3641.
20. Zambelli, G. 2009. On degenerate multi-row Gomory cuts. Oper. Res. Lett. 37(1) 21-22.