Parallel Local Search in Comet

DOI10.1007/11564751_33zbMath1153.90582OpenAlexW1505529854MaRDI QIDQ3524195

Laurent Michel, Pascal Van Hentenryck

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A GRASP approach for the extended car sequencing problem ⋮ Generic incremental algorithms for local search ⋮ Global constraint catalogue: past, present and future ⋮ Space and time allocation in a shipyard assembly hall ⋮ Dantzig-Wolfe decomposition and branch-and-price solving in G12 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ LocalSolver 1.x: A black-box local-search solver for 0-1 programming ⋮ Solving scheduling problems from high-level models ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ Search combinators ⋮ The design of the zinc modelling language ⋮ Integrating operations research in constraint programming ⋮ Integrating operations research in constraint programming ⋮ The weighted grammar constraint ⋮ Model-driven visualizations of constraint-based local search ⋮ Modeling with Metaconstraints and Semantic Typing of Variables

Uses Software

• COMET