Counting-based branching heuristics in CP have been very successful on a number of problems. Among the few remaining hurdles limiting their general applicability are the integration of counting information from auxiliary variables and the ability to handle combinatorial optimization problems. This paper proposes to answer these challenges by generalizing existing solution counting algorithms for constraints and by relaying counting information to the main branching variables through augmented element constraints. It offers more easily comparable solution counting information on variables and stronger back-propagation from the objective function in optimization problems. We provide supporting experimental results for the Capacitated Facility Location Problem. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Pesant, G., & Zanarini, A. (2011). Recovering indirect solution densities for counting-based branching heuristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6697 LNCS, pp. 170–175). https://doi.org/10.1007/978-3-642-21311-3_16
Mendeley helps you to discover research relevant for your work.