Parallel and distributed local search in COMET

DOI10.1016/j.cor.2008.08.014zbMath1179.90288OpenAlexW2093261637MaRDI QIDQ1010289

Laurent Michel, Andrew See, Pascal Van Hentenryck

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.014

zbMATH Keywords

combinatorial optimizationlocal searchlanguageparallelconstraint programmingdistributed

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, A review of literature on parallel constraint solving, A microkernel architecture for constraint programming, Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories, COMET, Large-scale parallelism for constraint-based local search: the costas array case study

Uses Software

• ALPS
• Cactus
• WSAT(OIP)
• BLIS
• BiCePS
• CHiPPS
• Cilk
• Carpet

Cites Work

• Optimal speedup of Las Vegas algorithms
• A simple tabu search for warehouse location
• A hybrid multistart heuristic for the uncapacitated facility location problem
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• A library hierarchy for implementing scalable parallel search algorithms
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Applying tabu search to the job-shop scheduling problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item