Explorative anytime local search for distributed constraint optimization

  title={Explorative anytime local search for distributed constraint optimization},
  author={Roie Zivan and Steven Okamoto and Hilla Peled},
  journal={Artif. Intell.},
Distributed Constraint Optimization Problems (DCOPs) are an elegant model for representing and solving many realistic combinatorial problems that are distributed by nature. DCOPs are NP-hard and therefore many recent studies consider incomplete algorithms for solving them. Distributed local search algorithms, in which agents in the system hold value assignments to their variables and iteratively make decisions on whether to replace them, can be used for solving DCOPs. However, because of the… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS
31 Citations
51 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 31 extracted citations

52 Citations

Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 51 references


  • H. Wu
  • van Beek, On universal restart strategies for…
  • 2007
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…