Achieving domain consistency and counting solutions for dispersion constraints
From MaRDI portal
Publication:2802248
Recommendations
Cites work
- scientific article; zbMATH DE number 2144493 (Why is no real title available?)
- A \texttt{cost-regular} based hybrid column generation approach
- A dynamic programming approach for consistency and propagation for knapsack constraints
- Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments
- Principles and Practice of Constraint Programming – CP 2004
- SPREAD: A Balancing Constraint Based on Statistics
- Solution counting algorithms for constraint-centered search heuristics
- The Deviation Constraint
Cited in
(8)- Counting weighted spanning trees to solve constrained minimum spanning tree problems
- SPREAD: A Balancing Constraint Based on Statistics
- A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property
- MDDs are efficient modeling tools: an application to some statistical constraints
- The Deviation Constraint
- Measures of balance in combinatorial optimization
- \(\mathbb{Q}\)-bounds consistency for the \textsc{spread} constraint with variable mean
- The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
This page was built for publication: Achieving domain consistency and counting solutions for dispersion constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802248)