The distributed breakout algorithms

DOI10.1016/j.artint.2004.08.004zbMath1132.68701OpenAlexW2151114562MaRDI QIDQ2457700

Makoto Yokoo, Katsutoshi Hirayama

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2004.08.004

zbMATH Keywords

local searchcoordinationSATdistributed constraint satisfaction

Mathematics Subject Classification ID

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

Related Items (7)

A review of literature on parallel constraint solving ⋮ Concurrent forward bounding for distributed constraint optimization problems ⋮ Explorative anytime local search for distributed constraint optimization ⋮ A distributed optimization method for the geographically distributed data centres problem ⋮ An efficient distributed optimization and coordination protocol: application to the emergency vehicle management ⋮ Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs ⋮ Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts

Cites Work

• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• A discrete Lagrangian-based global-search method for solving satisfiability problems
• Multistage negotiation for distributed constraint satisfaction
• Unnamed Item
• Unnamed Item

This page was built for publication: The distributed breakout algorithms