Parallel and distributed local search in COMET
type: Item
instance of: scholarly article
title: Parallel and distributed local search in COMET
zbMATH Open document ID: 1179.90288
author: Laurent Michel
author: Andrew See
author: Pascal Van Hentenryck
published in: Computers \& Operations Research
publication date: 2009-04-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 5539873
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: local search
zbMATH Keywords: constraint programming
zbMATH Keywords: parallel
zbMATH Keywords: distributed
zbMATH Keywords: language
describes a project that uses: ALPS
describes a project that uses: BiCePS
describes a project that uses: BLIS
describes a project that uses: CHiPPS
describes a project that uses: Cactus
describes a project that uses: WSAT(OIP)
describes a project that uses: Cilk
describes a project that uses: Carpet
MaRDI profile type: Publication
full work available at URL: j.cor.2008.08.014
OpenAlex ID: W2093261637
cites work: Optimal speedup of Las Vegas algorithms
cites work: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
cites work: A hybrid multistart heuristic for the uncapacitated facility location problem
cites work: Handbook of applied optimization
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
cites work: A simple tabu search for warehouse location
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: A library hierarchy for implementing scalable parallel search algorithms
cites work: Q4414769
DOI: 10.1016/J.COR.2008.08.014
description: scientific article; zbMATH DE number 5539873