Local cuts revisited

Operations Research Letters

Volumn 36, Issue 4, 2008, Pages 430-433

  Buchheim, Christoph ^a   Liers, Frauke ^a   Oswald, Marcus ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

Cutting plane separation; Integer programming; Local cuts; Project and lift; Traveling salesman problem

Indexed keywords

ELSEVIER (CO); GENERAL (CO); POLYTOPE;

EID: 46449097486     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.01.004     Document Type: Article

References (7)

1. Althaus E., Polzin T., and Daneshmand S. Improving linear programming approaches for the Steiner tree problem. Proceedings of WEA 2003. LNCS vol. 2647 (2003), Springer-Verlag 1-14
2. Applegate A., Bixby R., Chvátal V., and Cook W. Concorde TSP Solver. www.tsp.gatech.edu/concorde
3. Applegate A., Bixby R., Chvátal V., and Cook W. TSP cuts which do not conform to the template paradigm. Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions. LNCS vol. 2241 (2001), Springer-Verlag 261-304
4. Christof T., and Reinelt G. Algorithmic aspects of using small instance relaxations in parallel branch-and-cut. Algorithmica 30 (2001) 597-629
5. D. Espinoza, On linear programming, integer programming and cutting planes, Ph.D. Thesis, Georgia Institute of Technology, 2006
6. Gomory R.E., Johnson E.L., and Evans L. Corner polyhedra and their connection with cutting planes. Mathematical Programming 96 (2003) 321-339
7. Oswald M., Theis D.O., and Reinelt G. Not every GTSP facet induces an STSP facet. Proceedings of IPCO XI. LNCS vol. 3509 (2005), Springer-Verlag 468-482