1. Hartert, R., & Schaus, P. (2014). A support-based algorithm for the bi-objective pareto constraint. In C. E. Brodley, & P. Stone (Eds.), Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27 -31, 2014, Québec City, Québec, Canada (pp. 2674–2679). AAAI Press.
2. Rossi, F., Venable, K. B., & Walsh, T. (2008). Preferences in constraint satisfaction and optimization. AI Mag., 29, 58–68.
3. Hebrard, E., Hnich, B., O’Sullivan, B., & Walsh, T. (2005). Finding diverse and similar solutions in constraint programming. In AAAI (pp. 372–377). volume 5.
4. Hebrard, E. (2006). Robust Solutions for Constraint Satisfaction and Optimisation under Uncertainty. Ph.D. thesis University of New South Wales.
5. Meel, K. S. (2018). Constrained counting and sampling: bridging the gap between theory and practice. arXiv preprint arXiv:1806.02239, .