Understanding the potential of propagators
From MaRDI portal
Recommendations
- How efficient is a global constraint in practice? A fair experimental framework
- When is it worthwhile to propagate a constraint? A probabilistic analysis of \textsc{AllDifferent}
- Principles and Practice of Constraint Programming – CP 2004
- scientific article; zbMATH DE number 2080331
- Dynamic Analysis of Bounds Versus Domain Propagation
Cited in
(13)- 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
- Learning a propagation complete formula
- An efficient filtering algorithm for the unary resource constraint with transition times and optional activities
- A Lagrangian propagator for artificial neural networks in constraint programming
- Visual search tree profiling
- MDD propagators with explanation
- Constraint propagation on GPU: a case study for the cumulative constraint
- Explaining the \texttt{cumulative} propagator
- Constraint propagation on GPU: a case study for the cumulative constraint
This page was built for publication: Understanding the potential of propagators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741483)