Adaptive CP-based Lagrangian relaxation for TSP solving

DOI10.1007/978-3-030-58942-4_20MaRDI QIDQ2110420zbMATH OpenOpenAlexFDO

Authors Nicolas Isoart, Jean-Charles Régin

Publication date 21 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-58942-4_20

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1664847
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• Embedding relaxations in global constraints for solving TSP and TSPTW
• Continuous relaxations for the traveling salesman problem
• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• A Lagrangean relaxation method for the constrained assignment problem
• scientific article; zbMATH DE number 7650393
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
• Solving TSP through the integration of OR and CP techniques
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems

Cited in

(3)

• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• Improving the robustness of EPS to solve the TSP
• The theory of Lagrangian filtering zones: a case study on the knapsack constraint

This page was built for publication: Adaptive CP-based Lagrangian relaxation for TSP solving

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