Recovering indirect solution densities for counting-based branching heuristics

DOI10.1007/978-3-642-21311-3_16MaRDI QIDQ3003285zbMATH OpenOpenAlexFDO

Authors Gilles Pesant, Alessandro Zanarini

Publication date 26 May 2011

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21311-3_16

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Continuous location (90B85)

Recommendations

• Accelerating counting-based search
• Counting-based search: branching heuristics for constraint satisfaction problems
• Solution Counting Algorithms for Constraint-Centered Search Heuristics
• Solution counting algorithms for constraint-centered search heuristics
• Counting Solutions of Knapsack Constraints

Cited in

(1)

• Accelerating counting-based search

This page was built for publication: Recovering indirect solution densities for counting-based branching heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003285)