Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study

References

• Balas E., Ceria S., Cornuéjols G. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Sci. (1996) 42:1229–1246Link, Google Scholar
• Bixby R. E., Fenelon M., Gu Z., Rothberg E., Wunderling R., Powell M. J. D., Scholtes S. MIP: Theory and practice–closing the gap. System Modelling and Optimization: Methods, Theory, and Applications (2000) (Kluwer Academic Publishers, New York) 19–49Crossref, Google Scholar
• Caprara A., Fischetti M. {0, ½}-Chvátal-Gomory cuts. Math. Programming (1996) 74:221–235Crossref, Google Scholar
• Caprara A., Fischetti M., Letchford A. N. On the separation of maximally violated mod-k cuts. Math. Programming (2000) 87:37–56Crossref, Google Scholar
• Chvátal V. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. (1973) 4:305–337Crossref, Google Scholar
• Gomory R. E., Graves R. L., Wolfe P. An algorithm for integer solutions to linear programs. Recent Advances in Mathematical Programming (1963) (McGraw-Hill, New York) Google Scholar
• Gomory R. E., Johnson E. L., Evans L. Corner polyhedra and their connection with cutting planes. Math. Programming (2003) 96:321–339Crossref, Google Scholar
• Grötschel M., Lovász L., Schrijver A. J.Geometric Algorithms and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Johnson D. S., Trick M. A.Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1996) 26(American Mathematical Society, Providence, RI) Crossref, Google Scholar
• Reinelt G. Personal communication. (2003) Google Scholar
• Reinelt G., Wenger K. M. Maximally violated mod-p cuts for the capacitated vehicle-routing problem. INFORMS J. Comput. (2006) 18:466–479Link, Google Scholar