Provably good solutions for the traveling salesman problem
From MaRDI portal
Publication:4698114
DOI10.1007/BF01432809zbMATH Open0826.90118OpenAlexW2084340826MaRDI QIDQ4698114FDOQ4698114
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
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
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Maximum matching and a polyhedron with 0,1-vertices
- Solving (large scale) matching problems combinatorially
- Title not available (Why is that?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Facet identification for the symmetric traveling salesman polytope
- Odd Minimum Cut-Sets and b-Matchings
- Solution of large-scale symmetric travelling salesman problems
- Fast Algorithms for Geometric Traveling Salesman Problems
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Fast Heuristics for Large Geometric Traveling Salesman Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- How traveling salespersons prove their identity
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- Maximum planar subgraphs and nice embeddings: Practical layout tools
- Generating Travelling-Salesman Problems with Known Optimal Tours
- An evolutionary computing approach for parameter estimation investigation of a model for cholera
- Routing problems: A bibliography
- Combinatorial optimization and small polytopes
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
Uses Software
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)
