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

Authors:
Martin Desrochers;Gilbert Laporte
Affiliations:
GERAD and École Polytechnique, Montréal, Canada H3T 1V6;Centre de recherche sur les transports, Montréal, Canada H3C 3J7
Venue:
Operations Research Letters
Year:
1991

Citing 2
Cited 22

Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
Classification of travelling salesman problem formulations

Operations Research Letters

A reactive GRASP and path relinking for a combined production-distribution problem

Computers and Operations Research
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs

Discrete Applied Mathematics
Formulations and exact algorithms for the vehicle routing problem with time windows

Computers and Operations Research
Solving an urban waste collection problem using ants heuristics

Computers and Operations Research
Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations

Computers and Operations Research
Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints

Computers and Operations Research
Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems

Computers and Industrial Engineering
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation

Discrete Applied Mathematics
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints

Computers and Operations Research
Solving the single-machine sequencing problem using integer programming

Computers and Industrial Engineering
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays

Discrete Applied Mathematics
The inventory-routing problem with transshipment

Computers and Operations Research
A branch-and-cut algorithm for the preemptive swapping problem

Networks
The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

Mathematical and Computer Modelling: An International Journal
A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

Discrete Optimization
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs

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

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

Operations Research Letters
Tight compact models and comparative analysis for the prize collecting Steiner tree problem

Discrete Applied Mathematics
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures

Discrete Applied Mathematics
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm

Discrete Applied Mathematics
Lower and upper bounds for the spanning tree with minimum branch vertices

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and extended to various types of vehicle routing problems.