Classification of travelling salesman problem formulations

Authors:
André Langevin;François Soumis;Jacques Desrosiers
Affiliations:
École Polytechnique, Montréal, Canada;École Polytechnique, Montréal, Canada;École des Hautes Études Commerciales, Montréal, Canada
Venue:
Operations Research Letters
Year:
1990

Citing 2
Cited 8

An optimal solution method for large-scale multiple traveling salesmen problems

Operations Research
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)

Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations

Computers and Operations Research
On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints

Computers and Industrial Engineering
Survey of facial results for the traveling salesman polytope

Mathematical and Computer Modelling: An International Journal
Combined route capacity and route length models for unit demand vehicle routing problems

Discrete Optimization
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints

Operations Research Letters
A bilevel programming approach to the travelling salesman problem

Operations Research Letters
The multi-flow necessary condition for membership in the pedigree polytope is not sufficient- a counterexample

ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several single-commodity, two-commodity and multi-commodity flow formulations have recently been introduced for the travelling salesman problem. The purpose of this paper is to clarify the relations between these formulations and with other classical formulations. Some results are probably known by researchers in the area. However they have not yet been published. This paper groups them together.