Counting-Based Search for Constraint Optimization Problems
DOI:
https://doi.org/10.1609/aaai.v30i1.10433Abstract
Branching heuristics based on counting solutions in constraints have been quite good at guiding search to solve constraint satisfaction problems. But do they perform as well for constraint optimization problems? We propose an adaptation of counting-based search for optimization, show how to modify solution density computation for some of the most frequently-occurring constraints, and empirically evaluate its performance on several benchmark problems.
Downloads
Published
2016-03-05
How to Cite
Pesant, G. (2016). Counting-Based Search for Constraint Optimization Problems. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1). https://doi.org/10.1609/aaai.v30i1.10433
Issue
Section
Technical Papers: Search and Constraint Satisfaction