Exploiting entropy in constraint programming
From MaRDI portal
Publication:6080978
DOI10.1007/978-3-031-33271-5_21OpenAlexW4377231315MaRDI QIDQ6080978
Gilles Pesant, Auguste Burlats
Publication date: 4 October 2023
Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-33271-5_21
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)
Cites Work
- A Mathematical Theory of Communication
- Accelerating counting-based search
- Solution sampling with random table constraints
- MiniCP: a lightweight solver for constraint programming
- From Support Propagation to Belief Propagation in Constraint Programming
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Exploiting entropy in constraint programming