ML Anthology

Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable

Michael R. Fellows, Tobias Friedrich, Danny Hermelin, Nina Narodytska, Frances A. Rosamond
IJCAI 2011 pp. 522-527
doi:10.5591/978-1-57735-516-8/IJCAI11-095 /ijcai/2011/fellows2011ijcai-constraint/
PDF IJCAI Semantic Scholar

Cite

Text

Fellows et al. "Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-095

Markdown

[Fellows et al. "Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/fellows2011ijcai-constraint/) doi:10.5591/978-1-57735-516-8/IJCAI11-095

BibTeX

@inproceedings{fellows2011ijcai-constraint,
  title     = {{Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable}},
  author    = {Fellows, Michael R. and Friedrich, Tobias and Hermelin, Danny and Narodytska, Nina and Rosamond, Frances A.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {522-527},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-095},
  url       = {https://mlanthology.org/ijcai/2011/fellows2011ijcai-constraint/}
}