Achieving domain consistency and counting solutions for dispersion constraints
DOI10.1287/IJOC.2015.0654zbMATH Open1338.90352OpenAlexW2175971376MaRDI QIDQ2802248FDOQ2802248
Authors: Gilles Pesant 
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
Recommendations
combinatorial optimizationbalanceconstraint programmingfiltering algorithmsbranching heuristicscounting-based searchdeviation constraintspread constraint
Cites Work
- A \texttt{cost-regular} based hybrid column generation approach
- A dynamic programming approach for consistency and propagation for knapsack constraints
- Principles and Practice of Constraint Programming – CP 2004
- SPREAD: A Balancing Constraint Based on Statistics
- The Deviation Constraint
- Title not available (Why is that?)
- Solution counting algorithms for constraint-centered search heuristics
- Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments
Cited In (8)
- Counting weighted spanning trees to solve constrained minimum spanning tree problems
- SPREAD: A Balancing Constraint Based on Statistics
- MDDs are efficient modeling tools: an application to some statistical constraints
- A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property
- 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
Uses Software
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)
