A concise guide to the Traveling Salesman Problem
From MaRDI portal
Publication:3582631
DOI10.1057/jors.2009.76zbMath1193.90179WikidataQ96159064 ScholiaQ96159064MaRDI QIDQ3582631
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
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem, A cutting plane method for solving harvest scheduling models with area restrictions, 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 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, Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs, An efficient evolutionary algorithm for the ring star problem, A learning based algorithm for drone routing, Routing Optimization Under Uncertainty
Uses Software
