Survey of facial results for the traveling salesman polytope

Authors:
K. S. Ruland;E. Y. Rodin
Affiliations:
System & Electronics Inc. 201 Evans Lane St. Louis, MO 63121-1126, U.S.A.;Department of Systems Science & Mathematics Washington University Campus Box 1040, One Brookings Drive St. Louis, MO 63130, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1998

Citing 22
Cited 0

Clique tree inequalities and the symmetric travelling salesman problem

Mathematics of Operations Research
A new class of cutting planes for the symmetric travelling salesman problem

Mathematical Programming: Series A and B
A branch-and-cut approach to a traveling salesman problem with side constraints

Management Science
Facet identification for the symmetric traveling salesman polytope

Mathematical Programming: Series A and B
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Small travelling salesman polytopes

Mathematics of Operations Research
Facets of the asymmetric traveling salesman polytope

Mathematics of Operations Research
Optimizing over the subtour polytope of the travelling salesman problem

Mathematical Programming: Series A and B
Solution of large-scale symmetric travelling salesman problems

Mathematical Programming: Series A and B
An analytical comparison of different formulations of the travelling sales man problem

Mathematical Programming: Series A and B
The symmetric traveling salesman polytope and its graphical relaxation: composition of valid inequalities

Mathematical Programming: Series A and B
The traveling salesman problem in graphs with some excluded minors

Mathematical Programming: Series A and B
The crown inequalities for the symmetric traveling salesman polytope

Mathematics of Operations Research
The binested inequalities for the symmetric traveling salesman polytope

Mathematics of Operations Research
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets

Mathematical Programming: Series A and B
The graphical relaxation: a new framework for the Symmetric Traveling Salesman Polytope

Mathematical Programming: Series A and B
Hamiltonian path and symmetric travelling salesman polytopes

Mathematical Programming: Series A and B
Polyhedral study of the capacitated vehicle routing problem

Mathematical Programming: Series A and B
The Graphical Asymmetric Traveling Salesman Polyhedron

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
A complete description of the traveling salesman polytope on 8 nodes

Operations Research Letters
Classification of travelling salesman problem formulations

Operations Research Letters
Optimization of a 532-city symmetric traveling salesman problem by branch and cut

Operations Research Letters

Quantified Score

Hi-index	0.98

Visualization

Abstract

This paper surveys the facial structure of the Traveling Salesman Polytope and the closely related Graphical Relaxation Polyhedron. It contains an organized assimilation of various results.