Large-scale parallelism for constraint-based local search: the costas array case study

DOI10.1007/S10601-014-9168-4zbMath1316.90040OpenAlexW2164713934WikidataQ62612359 ScholiaQ62612359MaRDI QIDQ2342606

Philippe Codognet, Florian Richoux, Salvador Abreu, Yves Caniou, Daniel Diaz

Publication date: 29 April 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10174/17245

zbMATH Keywords

metaheuristicslocal searchparallelismimplementationCSP

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (4)

A review of literature on parallel constraint solving ⋮ Modeling the Costas array problem in QUBO for quantum annealing ⋮ Comparing QUBO models for quantum annealing: integer encodings for permutation problems ⋮ Large-scale parallelism for constraint-based local search: the costas array case study

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CSPLib
• LocalSolver
• PaMiraXT
• TTTPLOTS
• ChainSAT
• Sparrow2011
• Grid BnB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An overview of parallel SAT solving
• The enumeration of Costas arrays of order 28 and its consequences
• Results of the enumeration of costas arrays of order 29
• LocalSolver 1.x: A black-box local-search solver for 0-1 programming
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• Algebraic constructions for Costas arrays
• On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
• Parallel and distributed local search in COMET
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Nature's way of optimizing
• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
• Probability distribution of solution time in GRASP: an experimental investigation
• A general approach for constraint solving by local search
• Parallel local search
• Common distance vectors between Costas arrays
• Large-scale parallelism for constraint-based local search: the costas array case study
• An improved particle swarm optimization algorithm combined with piecewise linear chaotic map
• TTT plots: a perl program to create time-to-target plots
• A review of Costas arrays
• Embarrassingly Parallel Search in Constraint Programming
• Constructions and properties of Costas arrays
• Handbook of Approximation Algorithms and Metaheuristics
• Distributed Constraint-Based Local Search
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Trident, a New Pseudo Random Number Generator Based on Coupled Chaotic Maps
• Using sequential runtime distributions for the parallel speedup prediction of SAT local search
• Parallel Depth-Bounded Discrepancy Search
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Large-scale parallelism for constraint-based local search: the costas array case study