Revisiting counting solutions for the global cardinality constraint

DOI10.1613/JAIR.1.11325MaRDI QIDQ5235474zbMATH OpenOpenAlexFDO

Authors Giovanni Lo Bianco, Xavier Lorca, Charlotte Truchet, Gilles Pesant

Publication date 11 October 2019

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.11325

Mathematics Subject Classification ID

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

Recommendations

• More robust counting-based search heuristics with alldifferent constraints
• Counting solutions to CSP using generating polynomials
• The complexity of global cardinality constraints
• Solution counting algorithms for constraint-centered search heuristics
• Solution Counting Algorithms for Constraint-Centered Search Heuristics

Cited in

(2)

• The complexity of global cardinality constraints
• Lifted Reasoning for Combinatorial Counting

This page was built for publication: Revisiting counting solutions for the global cardinality constraint

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