More robust counting-based search heuristics with alldifferent constraints

DOI10.1007/978-3-642-13520-0_38zbMATH Open1285.68167OpenAlexW1567971647MaRDI QIDQ3569944FDOQ3569944

Authors: Alessandro Zanarini, Gilles Pesant 

Publication date: 22 June 2010

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-13520-0_38

Recommendations

• 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
• Accelerating counting-based search
• Counting Solutions of Knapsack Constraints

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (7)

• Counting-based search: branching heuristics for constraint satisfaction problems
• Solution counting algorithms for constraint-centered search heuristics
• Multi-level weighted all-different constraint
• Counting Solutions of Knapsack Constraints
• Accelerating counting-based search
• Solution Counting Algorithms for Constraint-Centered Search Heuristics
• Revisiting counting solutions for the global cardinality constraint

This page was built for publication: More robust counting-based search heuristics with alldifferent constraints

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