Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
TSP Cuts Which Do Not Conform to the Template Paradigm
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!
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
Mathematics of Operations Research
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
Mathematics of Operations Research
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
Branch and cut methods for network optimization
Mathematical and Computer Modelling: An International Journal
Survey of facial results for the traveling salesman polytope
Mathematical and Computer Modelling: An International Journal
Certification of an optimal TSP tour through 85,900 cities
Operations Research Letters
Operations Research Letters
Hi-index | 0.00 |