ML Anthology

Local Search with Constraint Propagation and Conflict-Based Heuristics

Narendra Jussien, Olivier Lhomme
AAAI 2000 pp. 169-174
/aaai/2000/jussien2000aaai-local/

Abstract

In this paper, we introduce a new solving algorithm for Constraint Satisfaction Problems (CSP). It performs an overall local search together with a domain filtering technique to prune the search space. Conflicts detected during filtering are used to guide the search. First experiments with a tabu version of the algorithm have shown good results on hard instances of open shop scheduling problems. It competes well with the best highly specialized algorithms.

PDF AAAI Semantic Scholar

Cite

Text

Jussien and Lhomme. "Local Search with Constraint Propagation and Conflict-Based Heuristics." AAAI Conference on Artificial Intelligence, 2000.

Markdown

[Jussien and Lhomme. "Local Search with Constraint Propagation and Conflict-Based Heuristics." AAAI Conference on Artificial Intelligence, 2000.](https://mlanthology.org/aaai/2000/jussien2000aaai-local/)

BibTeX

@inproceedings{jussien2000aaai-local,
  title     = {{Local Search with Constraint Propagation and Conflict-Based Heuristics}},
  author    = {Jussien, Narendra and Lhomme, Olivier},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2000},
  pages     = {169-174},
  url       = {https://mlanthology.org/aaai/2000/jussien2000aaai-local/}
}