Finding Diverse and Similar Solutions in Constraint Programming
Abstract
It is useful in a wide range of situations to find solutions which are diverse (or similar) to each other. We therefore define a number of different classes of diversity and simi-larity problems. For example, what is the most diverse set of solutions of a constraint satisfaction problem with a given cardinality? We first determine the computational complexity of these problems. We then propose a number of practical so-lution methods, some of which use global constraints for en-forcing diversity (or similarity) between solutions. Empirical evaluation on a number of problems show promising results.
Cite
Text
Hebrard et al. "Finding Diverse and Similar Solutions in Constraint Programming." AAAI Conference on Artificial Intelligence, 2005.Markdown
[Hebrard et al. "Finding Diverse and Similar Solutions in Constraint Programming." AAAI Conference on Artificial Intelligence, 2005.](https://mlanthology.org/aaai/2005/hebrard2005aaai-finding/)BibTeX
@inproceedings{hebrard2005aaai-finding,
title = {{Finding Diverse and Similar Solutions in Constraint Programming}},
author = {Hebrard, Emmanuel and Hnich, Brahim and O'Sullivan, Barry and Walsh, Toby},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2005},
pages = {372-377},
url = {https://mlanthology.org/aaai/2005/hebrard2005aaai-finding/}
}