TSP Cuts Which Do Not Conform to the Template Paradigm
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Improving linear programming approaches for the steiner tree problem
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Not every GTSP facet induces an STSP facet
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A basic toolbox for constrained quadratic 0/1 optimization
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
An exact algorithm for robust network design
INOC'11 Proceedings of the 5th international conference on Network optimization
Models and algorithms for robust network design with several traffic scenarios
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |
We present a variant of the local cut generation procedure by Applegate, Bixby, Chvatal and Cook. Unlike the original procedure, our method immediately yields a facet of the projected polytope as the solution of a single LP, without the need for the time-consuming tilting step. Moreover, our facets have big volume in general.