The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
From MaRDI portal
Publication:1806889
DOI10.1016/S0377-2217(97)00358-5zbMath0971.90099OpenAlexW2092353499MaRDI QIDQ1806889
Jose Manuel Pires, Luís Gouveia
Publication date: 20 December 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00358-5
Related Items (29)
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints ⋮ Models for a Steiner multi-ring network design problem with revenues ⋮ Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations ⋮ Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ Selective routing problem with synchronization ⋮ Competitiveness based on logistic management: a real case study ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ Tight lower bounds for the traveling salesman problem with draft limits ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm ⋮ Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems ⋮ New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints ⋮ A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions ⋮ Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem ⋮ A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations ⋮ A comparative analysis of several asymmetric traveling salesman problem formulations ⋮ The effect of the asymmetry of road transportation networks on the traveling salesman problem ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem ⋮ Unnamed Item ⋮ New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints ⋮ Models for a Steiner ring network design problem with revenues ⋮ A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints ⋮ The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints ⋮ Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning ⋮ Strong multi-commodity flow formulations for the asymmetric traveling salesman problem ⋮ Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints ⋮ Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? ⋮ A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks ⋮ An efficient genetic algorithm for the traveling salesman problem with precedence constraints ⋮ A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
Cites Work
- Classification of travelling salesman problem formulations
- A result on projection for the vehicle routing problem
- An analytical comparison of different formulations of the travelling salesman problem
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Facets of the Asymmetric Traveling Salesman Polytope
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
