Optimizing over the first Chvátal closure

Mathematical Programming

Volumn 110, Issue 1, 2007, Pages 3-20

  Fischetti, Matteo ^a   Lodi, Andrea ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Chv tal Gomory cuts; Computational analysis; Integer programs; Separation problems

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; INTEGRAL EQUATIONS; OPTIMIZATION; PROBLEM SOLVING;

COMPUTATIONAL ANALYSIS; OPTIMAL SOLUTIONS; SEPARATION PROBLEMS;

MATHEMATICAL PROGRAMMING;

EID: 33947096119     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0054-8     Document Type: Article

References (20)

1. Achterberg, T., Koch, T., Martin, A.: The mixed integer programming library: MIPLIB 2003, http://www.miplib.zib.de (2003)
2. Balas, E.: The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. SIAM J. Discrete Math. 2, 425-451 (1989)
3. Balas, E., Fischetti, M.: A lifting procedure for the Asymmetric Traveling Salesman Polytope and a large new class of facets. Math. Program. 58, 325-352 (1993)
4. Balas, E., Saxena, A.: Optimizing over the split closure, Technical Report 2006-E5, Tepper School of Business, CMU (2005)
5. Bonami, P., Cornuejols, G., Dash, S., Fischetti, M., Lodi, A.: Projected Chvatal-Gomory cuts for mixed integer linear programs. Technical Report 2006-E4, Tepper School of Business, CMU, to appear Math. Program, (in press)
6. Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: MIPLIB 3.0, http://www.caam.rice.edu/~bixby/miplib/miplib.html
7. Caprara, A., Letchford, A.N.: On the separation of split cuts and related inequalities. Math. Program. 94, 279-294 (2003)
8. Christof, T., Löbel, A.: PORTA - Polyhedron representation transformation algorithm, http://www.zib.de/Optimization/Software/Porta/
9. Chvátal, V: Edmonds polytopes and a hierarchy of combinatorial problems.. Discrete Math. 4, 305-337 (1973)
10. Dash, S., Günlük, O., Lodi, A.: On the MIR closure of polyhedra. IBM, T.J. Watson Research, Working paper, (2005)
11. Edmonds, J.: Maximum matching and a polyhedron with (0,1)-vertices. J. Res. Nat. Bur. Stand. B 69, 125-130 (1965)
12. Edmonds, J., Johnson, H.L.: Matching: a well-solved class of integer linear programs. In: Guy, R.K., et al. (eds.) Combinatorial Structures and their Applications, pp. 89-92. Gordon and Breach, New York (1970)
13. Eisenbrand, F.: On the membership problem for the elementary closure of a polyhedron. Combinatorica 19, 297-300 (1999)
14. Fischetti, M., Lodi, A: Optimizing over the first Chvátal closure. In: Jünger, M., Kaibel, V. (eds.) Integer programming and combinatorial optimization - IPCO 2005, LNCS 3509, pp. 12-22. Springer, Berlin Heidelberg New York (2005)
15. Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. AMS 64, 275-278 (1958)
16. Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 275. McGraw-Hill, New York (1963)
17. ILOG Cplex 9.1: User's manual and reference manual, ILOG, S.A. http://www.ilog.com/(2005)
18. Letchford, A.N., Reinelt, G., Theis, D.O.: A faster exact separation algorithm for blossom inequalities. In: Bienstock, D., Nemhauser, G. (eds.) Integer programming and combinatorial optimization - IPCO 2004, LNCS 3064, pp. 196-205. Springer, Berlin Heidelberg New York (2004)
19. Nemhauser, G.L., Wolsey, L. A.: Integer and Combinatorial Optimization. Wiley, New York (1988)
20. Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7, 67-80 (1982)