Provably good solutions for the traveling salesman problem

DOI10.1007/BF01432809MaRDI QIDQ4698114zbMATH OpenOpenAlexFDO

Authors Michael Jünger, Stefan Thienel, Gerhard Reinelt

Publication date 25 June 1995

Published in 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)

Recommendations

• On the solution of traveling salesman problems
• On the approximability of the traveling salesman problem
• scientific article; zbMATH DE number 4095236
• Solving the \(k\)-best traveling salesman problem
• On the solution of the traveling salesman problem once again
• On the approximability of the traveling salesman problem (extended abstract)
• scientific article; zbMATH DE number 16721
• scientific article; zbMATH DE number 34438
• scientific article; zbMATH DE number 238296
• The traveling salesman problem. Approximate algorithms

Cites work

• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1263290 (Why is no real title available?)
• scientific article; zbMATH DE number 1175953 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Facet identification for the symmetric traveling salesman polytope
• Fast Algorithms for Geometric Traveling Salesman Problems
• Fast Heuristics for Large Geometric Traveling Salesman Problems
• Maximum matching and a polyhedron with 0,1-vertices
• Odd Minimum Cut-Sets and b-Matchings
• Solution of large-scale symmetric travelling salesman problems
• Solving (large scale) matching problems combinatorially
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(8)

• How traveling salespersons prove their identity
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
• Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
• Routing problems: A bibliography
• Generating Travelling-Salesman Problems with Known Optimal Tours
• An evolutionary computing approach for parameter estimation investigation of a model for cholera
• Combinatorial optimization and small polytopes
• Maximum planar subgraphs and nice embeddings: Practical layout tools

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Provably good solutions for the traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698114)