Achieving Domain Consistency and Counting Solutions for Dispersion Constraints
From MaRDI portal
Publication:2802248
DOI10.1287/ijoc.2015.0654zbMath1338.90352OpenAlexW2175971376MaRDI QIDQ2802248
Publication date: 25 April 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/027785ae63b9416bed437ef36fa4c23ba941c811
combinatorial optimizationconstraint programmingbalancefiltering algorithmsbranching heuristicscounting-based searchdeviation constraintspread constraint
Related Items (6)
A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property ⋮ \(\mathbb{Q}\)-bounds consistency for the \textsc{spread} constraint with variable mean ⋮ Measures of balance in combinatorial optimization ⋮ The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints ⋮ MDDs are efficient modeling tools: an application to some statistical constraints ⋮ Counting weighted spanning trees to solve constrained minimum spanning tree problems
Uses Software
Cites Work
- Unnamed Item
- A \texttt{cost-regular} based hybrid column generation approach
- A dynamic programming approach for consistency and propagation for knapsack constraints
- Solution counting algorithms for constraint-centered search heuristics
- Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments
- SPREAD: A Balancing Constraint Based on Statistics
- The Deviation Constraint
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Achieving Domain Consistency and Counting Solutions for Dispersion Constraints
