A weighted counting algorithm for the circuit constraint

DOI10.1007/978-3-031-33271-5_24MaRDI QIDQ6080983zbMATH OpenOpenAlexFDO

Authors Gauthier Pezzoli, Gilles Pesant

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_24

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx) Combinatorial optimization (90C27)

Cites work

• An exact constraint logic programming algorithm for the traveling salesman problem with time windows
• Approximating the permanent: A simple approach
• From support propagation to belief propagation in constraint programming
• Improved filtering for weighted circuit constraints

Cited in

(3)

• The \textsc{WeightedCircuitsLmax} constraint
• Improved filtering for weighted circuit constraints
• scientific article; zbMATH DE number 7204563 (Why is no real title available?)

This page was built for publication: A weighted counting algorithm for the circuit constraint

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