Improving the robustness of EPS to solve the TSP

DOI10.1007/978-3-031-08011-1_12zbMath1502.68272OpenAlexW4285176136MaRDI QIDQ2170194

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

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

Uses Software

• TSPLIB
• LKH
• Bob++

Cites Work

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