Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts

Abstract

A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, augmented by a coarse-grained local search algorithm that learns favorable value heuristics over the course of several restarts. Numerical results show that this method can speed-up complete search by orders of magnitude.

Cite

Text

Sellmann and Ansótegui. "Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts." AAAI Conference on Artificial Intelligence, 2006.

Markdown

[Sellmann and Ansótegui. "Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts." AAAI Conference on Artificial Intelligence, 2006.](https://mlanthology.org/aaai/2006/sellmann2006aaai-disco/)

BibTeX

@inproceedings{sellmann2006aaai-disco,
  title     = {{Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts}},
  author    = {Sellmann, Meinolf and Ansótegui, Carlos},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2006},
  pages     = {1051-1056},
  url       = {https://mlanthology.org/aaai/2006/sellmann2006aaai-disco/}
}