On the symmetric travelling salesman problem: A computational study

Related Items

The hierarchical network design problem, Optimization of a 532-city symmetric traveling salesman problem by branch and cut, A new class of cutting planes for the symmetric travelling salesman problem, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies, On approximately fair cost allocation in Euclidean TSP games, A revisited branch-and-cut algorithm for large-scale orienteering problems, Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times, Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem, On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming, An exact algorithm for the asymmetrical capacitated vehicle routing problem, Facet identification for the symmetric traveling salesman polytope, The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities, George Dantzig's contributions to integer programming, The traveling salesman problem: An overview of exact and approximate algorithms, The prize collecting traveling salesman problem, Polyhedral study of the capacitated vehicle routing problem, Hooked on IP, Non-standard approaches to integer programming, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Hamiltonian path and symmetric travelling salesman polytopes, The general routing polyhedron: A unifying framework, Valid inequalities and facets of the capacitated plant location problem, Facets and algorithms for capacitated lot sizing, Survey of facial results for the traveling salesman polytope, Some facets of the simple plant location polytope, Optimizing over the subtour polytope of the travelling salesman problem, A technique for speeding up the solution of the Lagrangean dual, A cutting plane procedure for the travelling salesman problem on road networks