New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints

Authors:
Subhash C. Sarin;Hanif D. Sherali;Ajay Bhootra
Affiliations:
Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, 250 Durham Hall, Blacksburg, VA 24061, USA;Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, 250 Durham Hall, Blacksburg, VA 24061, USA;Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, 250 Durham Hall, Blacksburg, VA 24061, USA
Venue:
Operations Research Letters
Year:
2005

Citing 9
Cited 5

An analytical comparison of different formulations of the travelling sales man problem

Mathematical Programming: Series A and B
The precedence-constrained asymmetric traveling salesman polytope

Mathematical Programming: Series A and B
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Computational Optimization and Applications
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin contraints

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems

Operations Research
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints

Operations Research Letters
Compact vs. exponential-size LP relaxations

Operations Research Letters

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

Computers and Operations Research
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

Discrete Optimization
Tight compact models and comparative analysis for the prize collecting Steiner tree problem

Discrete Applied Mathematics
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem

Discrete Applied Mathematics
Minimizing conditional-value-at-risk for stochastic scheduling problems

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new formulation for the asymmetric traveling salesman problem, with and without precedence relationships, which employs a polynomial number of subtour elimination constraints that imply an exponential subset of certain relaxed Dantzig-Fulkerson-Johnson subtour constraints. Promising computational results are presented, particularly in the presence of precedence constraints.