Improving the Held and Karp Approach with Constraint Programming

DOI10.1007/978-3-642-13520-0_6MaRDI QIDQ3569917zbMATH OpenOpenAlexFDO

Authors Pascal Benchimol, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher, Willem-Jan van Hoeve

Publication date 22 June 2010

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13520-0_6

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2098018
• Enhancing the performance of constraint programming through the introduction of linear programming
• An enhancement scheme for constraint satisfaction problems (CSPs)
• Artificial Intelligence: Methodology, Systems, and Applications
• Constraint programming: strategic directions
• Improved constraint-aggregation methods
• From LP to LP: Programming with constraints
• A methodological view of constraint solving

Cited in

(5)

• Embedding relaxations in global constraints for solving TSP and TSPTW
• Efficient optimization of the Held-Karp lower bound
• scientific article; zbMATH DE number 2080307 (Why is no real title available?)
• Toward unification of exact and heuristic optimization methods
• Graph convolutional branch and bound

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: Improving the Held and Karp Approach with Constraint Programming

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