Improving the robustness of EPS to solve the TSP

DOI10.1007/978-3-031-08011-1_12MaRDI QIDQ2170194zbMATH OpenOpenAlexFDO

Authors Nicolas Isoart, Jean-Charles Régin

Publication date 30 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-08011-1_12

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Improving robustness of solutions to arc routing problems
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
• An improved approximation algorithm for the maximum TSP
• Improving Christofides' algorithm for the s-t path TSP
• Improving Christofides' algorithm for the \(s\)-\(t\) path TSP
• Improved inapproximability for TSP
• Improved inapproximability for TSP
• Improved deterministic approximation algorithms for max TSP

Cites work

• Adaptive CP-based Lagrangian relaxation for TSP solving
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Depth-first iterative-deepening: An optimal admissible tree search
• Embarrassingly parallel search in constraint programming
• Handbook of parallel constraint reasoning
• Reasoning from last conflict(s) in constraint programming
• The salesman and the tree: the importance of search in CP
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(1)

• Embarrassingly parallel search in constraint programming

Describes a project that uses

Uses Software

• LKH
• TSPLIB
• Bob++

This page was built for publication: Improving the robustness of EPS to solve the TSP

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