@inproceedings{540c019b291141d8a0dc25d625d9b9e3,
title = "Solving sudoku with constraint programming",
abstract = "Constraint Programming (CP) is a powerful paradigm for modeling and solving Complex Combinatorial Problems (generally issued from Decision Making). In this work, we model the known Sudoku puzzle as a Constraint Satisfaction Problems and solve it with CP comparing the performance of different Variable and Value Selection Heuristics in its Enumeration phase. We encourage this kind of benchmark problem because it may suggest new techniques in constraint modeling and solving of complex systems, or aid the understanding of its main advantages and limits.",
author = "Broderick Crawford and Carlos Castro and Eric Monfroy",
note = "Funding Information: Acknowledgements. Research funded by NSERC Grant 250279-02 and a grant from the CITO/IBM-CAS Student Internship Program. L. Bertossi is Faculty Fellow of the IBM Center for Advanced Studies, Toronto Lab. We appreciate conversations with Ariel Fuxman and Pablo Barcelo.",
year = "2009",
doi = "10.1007/978-3-642-02298-2_52",
language = "English",
isbn = "9783642022975",
series = "Communications in Computer and Information Science",
publisher = "Springer Verlag",
pages = "345--348",
booktitle = "Cutting-Edge Research Topics on Multiple Criteria Decision Making",
}