Provably good solutions for the traveling salesman problem

DOI10.1007/BF01432809zbMath0826.90118OpenAlexW2084340826MaRDI QIDQ4698114

Stefan Thienel, Michael Jünger, Gerhard Reinelt

Publication date: 25 June 1995

Published in: [https://portal.mardi4nfdi.de/entity/Q4289815 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01432809

zbMATH Keywords

traveling salesmantrue optimum solutions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Routing problems: A bibliography, Maximum planar subgraphs and nice embeddings: Practical layout tools, How traveling salespersons prove their identity, An evolutionary computing approach for parameter estimation investigation of a model for cholera, A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, Combinatorial optimization and small polytopes

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving (large scale) matching problems combinatorially
• Solution of large-scale symmetric travelling salesman problems
• Facet identification for the symmetric traveling salesman polytope
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Odd Minimum Cut-Sets and b-Matchings
• TSPLIB—A Traveling Salesman Problem Library
• Fast Algorithms for Geometric Traveling Salesman Problems
• Fast Heuristics for Large Geometric Traveling Salesman Problems
• Maximum matching and a polyhedron with 0,1-vertices
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem