A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
From MaRDI portal
Recommendations
- A New Formulation for the Travelling Salesman Problem
- Classification of travelling salesman problem formulations
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Teaching Integer Programming Formulations Using the Traveling Salesman Problem
- An analytical comparison of different formulations of the travelling salesman problem
Cited in
(38)- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- An analytical comparison of different formulations of the travelling salesman problem
- On symmetric subtour problems
- The two-period travelling salesman problem applied to milk collection in Ireland
- Compact vs. exponential-size LP relaxations
- Integer programming models and linearizations for the traveling car renter problem
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- Identification of unidentified equality constraints for integer programming problems
- The demand weighted vehicle routing problem
- An analog of the Cook theorem for polytopes
- Computing the variance of tour costs over the solution space of the TSP in polynomial time
- An alternate formulation of the symmetric traveling salesman problem and its properties
- The graphical traveling salesperson problem has no integer programming formulation in the original space
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs
- Sparsity of integer formulations for binary programs
- The influence of problem specific neighborhood structures in metaheuristics performance
- Symmetric travelling salesman problem. Some new algorithmic possibilities
- Integer linear programming formulations of multiple salesman problems and its variations
- Compact formulations of the Steiner traveling salesman problem and related problems
- Hop-indexed circuit-based formulations for the traveling salesman problem
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
- scientific article; zbMATH DE number 3883908 (Why is no real title available?)
- scientific article; zbMATH DE number 4143778 (Why is no real title available?)
- Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration
- Generalized Subtour Elimination Constraints and Connectivity Constraints
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
- Teaching Integer Programming Formulations Using the Traveling Salesman Problem
- The travelling salesman problem with neighbourhoods: MINLP solution
- Advances in Combinatorial Optimization
- On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
- Learn global and optimize local: a data-driven methodology for last-mile routing
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut
- Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
- Classification of travelling salesman problem formulations
- A comparative analysis of several asymmetric traveling salesman problem formulations
This page was built for publication: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5297404)
