Classification of travelling salesman problem formulations
From MaRDI portal
Publication:911990
DOI10.1016/0167-6377(90)90052-7zbMath0697.90057OpenAlexW2001994662MaRDI QIDQ911990
Jacques Desrosiers, André Langevin, François Soumis
Publication date: 1990
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(90)90052-7
Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items (28)
Topological design of a two-level network with ring-star configuration ⋮ The traveling salesman problem with time-dependent service times ⋮ Routing problems: A bibliography ⋮ Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope ⋮ The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem ⋮ Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout ⋮ A classification of formulations for the (time-dependent) traveling salesman problem ⋮ A bilevel programming approach to the travelling salesman problem. ⋮ Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem ⋮ Natural and extended formulations for the time-dependent traveling salesman problem ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ A comparative analysis of several asymmetric traveling salesman problem formulations ⋮ On symmetric subtour problems ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem ⋮ Unnamed Item ⋮ The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints ⋮ Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints ⋮ Integer programming formulations for the \(k\)-in-a-tree problem in graphs ⋮ Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning ⋮ Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? ⋮ The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints ⋮ An efficient genetic algorithm for the traveling salesman problem with precedence constraints ⋮ A branch and bound algorithm for symmetric 2-peripatetic salesman problems ⋮ Survey of facial results for the traveling salesman polytope ⋮ Projection results for vehicle routing ⋮ Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
Cites Work
- Unnamed Item
- Unnamed Item
- Integer Programming Formulation of Traveling Salesman Problems
- A New Formulation for the Travelling Salesman Problem
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- The traveling-salesman problem and minimum spanning trees: Part II
This page was built for publication: Classification of travelling salesman problem formulations
