Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
On the Separation of Maximally Violated mod-k Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
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]
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
A procedure of facet composition for the symmetric traveling salesman polytope
Combinatorial optimization - Eureka, you shrink!
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
Mathematics of Operations Research
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
Mathematics of Operations Research
The Black and White Traveling Salesman Problem
Operations Research
On the general routing polytope
Discrete Applied Mathematics
Computing finest mincut partitions of a graph and application to routing problems
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
New facets of the STS polytope generated from known facets of the ATS polytope
Discrete Optimization
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
Hi-index | 0.00 |