Understanding the Potential of Propagators
From MaRDI portal
Publication:5741483
DOI10.1007/978-3-319-18008-3_29zbMath1459.68195OpenAlexW2296178629MaRDI QIDQ5741483
Pierre Schaus, Sascha van Cauwelaert, Michele Lombardi
Publication date: 25 July 2016
Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18008-3_29
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (9)
Visual search tree profiling ⋮ A Lagrangian propagator for artificial neural networks in constraint programming ⋮ Constraint propagation on GPU: a case study for the cumulative constraint ⋮ An efficient filtering algorithm for the unary resource constraint with transition times and optional activities ⋮ Efficient filtering for the resource-cost alldifferent constraint ⋮ How efficient is a global constraint in practice? A fair experimental framework ⋮ The item dependent stockingcost constraint ⋮ The weighted arborescence constraint ⋮ Injecting domain knowledge in neural networks: a controlled experiment on a constrained problem
This page was built for publication: Understanding the Potential of Propagators
