The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
From MaRDI portal
(Redirected from Publication:1806889)
Recommendations
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- A note on the complexity of the asymmetric traveling salesman problem
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- Transforming asymmetric into symmetric traveling salesman problems: Erratum
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- On the LP relaxation of the asymmetric traveling salesman path problem
Cites work
- scientific article; zbMATH DE number 3904331 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- A result on projection for the vehicle routing problem
- An analytical comparison of different formulations of the travelling salesman problem
- Classification of travelling salesman problem formulations
- Facets of the Asymmetric Traveling Salesman Polytope
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Integer Programming Formulation of Traveling Salesman Problems
- Network flows. Theory, algorithms, and applications.
- Solution of a Large-Scale Traveling-Salesman Problem
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
Cited in
(39)- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
- A comparative analysis of several asymmetric traveling salesman problem formulations
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm
- Models for a Steiner multi-ring network design problem with revenues
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
- Competitiveness based on logistic management: a real case study
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- Models for a Steiner ring network design problem with revenues
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- Compact formulations for multi-depot routing problems: theoretical and computational comparisons
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
- Selective routing problem with synchronization
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- A set covering approach for the double traveling salesman problem with multiple stacks
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
- The asymmetric traveling salesman problem with replenishment arcs
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- Compact vs. exponential-size LP relaxations
- Tight lower bounds for the traveling salesman problem with draft limits
- A simple LP relaxation for the asymmetric traveling salesman problem
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
- Hop-indexed circuit-based formulations for the traveling salesman problem
- On a time-dependent formulation and an updated classification of ATSP formulations
This page was built for publication: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806889)
