Principles and Practice of Constraint Programming – CP 2004

DOI10.1007/b100482zbMath1152.68572OpenAlexW1508891358MaRDI QIDQ5900312

Vincent Furnon, Paul Shaw, Laurent Perron

Publication date: 9 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100482

Mathematics Subject Classification ID

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

Related Items (15)

A GRASP approach for the extended car sequencing problem ⋮ Principles for the design of large neighborhood search ⋮ Underground mine scheduling of mobile machines using constraint programming and large neighborhood search ⋮ Constraint-based very large-scale neighborhood search ⋮ Large neighborhood improvements for solving car sequencing problems ⋮ LocalSolver 1.x: A black-box local-search solver for 0-1 programming ⋮ The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem ⋮ Two local search approaches for solving real-life car sequencing problems ⋮ Integrating operations research in constraint programming ⋮ Integrating operations research in constraint programming ⋮ Local search and constraint programming for the post enrolment-based course timetabling problem ⋮ Large neighbourhood search algorithms for the founder sequence reconstruction problem ⋮ Variable neighborhood search for graphical model energy minimization ⋮ An optimal arc consistency algorithm for a particular case of sequence constraint ⋮ Explanation-based large neighborhood search

This page was built for publication: Principles and Practice of Constraint Programming – CP 2004