Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
Polynomial-Time Separation of Simple Comb Inequalities
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
TSP Cuts Which Do Not Conform to the Template Paradigm
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
Mathematics of Operations Research
On the general routing polytope
Discrete Applied Mathematics
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Not every GTSP facet induces an STSP facet
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Survey of facial results for the traveling salesman polytope
Mathematical and Computer Modelling: An International Journal
Operations Research Letters
Hi-index | 0.01 |