A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
From MaRDI portal
Publication:5297404
DOI10.1007/3-540-36626-1_5zbMath1183.90309OpenAlexW2107535850MaRDI QIDQ5297404
Publication date: 18 July 2007
Published in: Optimisation, Econometric and Financial Analysis (Search for Journal in Brave)
Full work available at URL: http://eprints.lse.ac.uk/9349/1/WP67_A_Survey_of_DifferentFormulationsoftheTSPJuly20051LSEROVERSION.pdf
Integer programming (90C10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
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, Learn global and optimize local: a data-driven methodology for last-mile routing, Computing the variance of tour costs over the solution space of the TSP in polynomial time, New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints, On the generation of metric TSP instances with a large integrality gap by branch-and-cut, A comparative analysis of several asymmetric traveling salesman problem formulations, The demand weighted vehicle routing problem, An analog of the Cook theorem for polytopes, The travelling salesman problem with neighbourhoods: MINLP solution, Unnamed Item, A cutting plane method for risk-constrained traveling salesman problem with random arc costs, Strong multi-commodity flow formulations for the asymmetric traveling salesman problem, Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration, The influence of problem specific neighborhood structures in metaheuristics performance, Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
