A concise guide to the Traveling Salesman Problem

DOI10.1057/jors.2009.76zbMath1193.90179DBLPjournals/jors/Laporte10OpenAlexW2072699573WikidataQ96159064 ScholiaQ96159064MaRDI QIDQ3582631

Gilbert Laporte

Publication date: 2 September 2010

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.2009.76

zbMATH Keywords

softwareheuristicstraveling salesman problemexact algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (10)

Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem ⋮ MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem ⋮ Adapting the traveling salesman problem to an adiabatic quantum computer ⋮ A learning based algorithm for drone routing ⋮ Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs ⋮ A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs ⋮ Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ Routing Optimization Under Uncertainty ⋮ A cutting plane method for solving harvest scheduling models with area restrictions ⋮ An efficient evolutionary algorithm for the ring star problem

Uses Software

• LKH
• Concorde

This page was built for publication: A concise guide to the Traveling Salesman Problem