Embedding {0,1/2}-cuts in a Braneh-and-cut framework: A computational study

INFORMS Journal on Computing

Volumn 19, Issue 2, 2007, Pages 229-238

  Andreello, Giuseppe ^a   Caprara, Alberto ^b   Fischetti, Matteo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Algorithms; Applications; Cutting plane; programming; Integer; Programming

Indexed keywords

EID: 44649140605     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1050.0162     Document Type: Article

References (11)

1. Balas, E., S. Ceria, G. Cornuéjols. 1996. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Sci. 42 1229-1246.
2. Bixby R. E, M. Fenelon, Z. Gu, E. Rothberg, R. Wunderling. 2000. MIP: Theory and practice-closing the gap. M. J. D. Powell, S. Scholtes, eds. System Modelling and Optimization: Methods, Theory, and Applications. Kluwer Academic Publishers, New York, 19-49.
3. Caprara, A., M. Fischctti. 1996. |0, 1/2 )-Chvátal-Gomory cuts. Math. Programming 74 221-235.
4. Caprara, A., M. Fischetti, A. N. Letchford. 2000. On the separation of maximally violated mod-k cuts. Math. Programming 87 37-56.
5. Chvátal, V. 1973. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4 305-337.
6. 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.
7. Gomory, R. E., E. L. Johnson, L. Evans. 2003. Corner polyhedra and their connection with cutting planes. Math. Programming 96 321-339.
8. Grötschel, M., L. Lovász, A. J. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. Wiley, New York.
9. Johnson, D, S., M. A. Trick, eds. 1996. Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26. American Mathematical Society, Providence, EI.
10. Reinelt, G. 2003. Personal communication.
11. Reinelt, G., K. M. Wenger. 2006. Maximally violated mod-p cuts for the capacitated vehicle-routing problem. INFORMS J. Comput. 18 466-479.