Classification of travelling salesman problem formulations
From MaRDI portal
Publication:911990
Recommendations
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- scientific article; zbMATH DE number 4143778
- A comparative analysis of several asymmetric traveling salesman problem formulations
- scientific article; zbMATH DE number 3883908
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
Cites work
- scientific article; zbMATH DE number 4143778 (Why is no real title available?)
- scientific article; zbMATH DE number 3910111 (Why is no real title available?)
- A New Formulation for the Travelling Salesman Problem
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Integer Programming Formulation of Traveling Salesman Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(32)- A bilevel programming approach to the travelling salesman problem.
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- On symmetric subtour problems
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
- Topological design of a two-level network with ring-star configuration
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Combined route capacity and route length models for unit demand vehicle routing problems
- scientific article; zbMATH DE number 3883908 (Why is no real title available?)
- Integer programming formulations for the \(k\)-in-a-tree problem in graphs
- Natural and extended formulations for the time-dependent traveling salesman problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- Hop-indexed circuit-based formulations for the traveling salesman problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem
- Survey of facial results for the traveling salesman polytope
- The traveling salesman problem: An overview of exact and approximate algorithms
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
- Routing problems: A bibliography
- A comparative analysis of several asymmetric traveling salesman problem formulations
- 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
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- The traveling salesman problem with time-dependent service times
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- scientific article; zbMATH DE number 4143778 (Why is no real title available?)
- Projection results for vehicle routing
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
This page was built for publication: Classification of travelling salesman problem formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911990)
