A dynamic programming approach for consistency and propagation for knapsack constraints
From MaRDI portal
Publication:1861937
DOI10.1023/A:1021801522545zbMath1027.90075MaRDI QIDQ1861937
Publication date: 10 March 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (17)
Constraint programming and operations research ⋮ Power of pre-processing: production scheduling with variable energy pricing and power-saving states ⋮ New filtering algorithms for combinations of among constraints ⋮ Tractability-preserving transformations of global cost functions ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property ⋮ A constraint programming approach for a batch processing problem with non-identical job sizes ⋮ Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming ⋮ Exact solution of network flow models with strong relaxations ⋮ Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs ⋮ New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles ⋮ Counting Solutions of Knapsack Constraints ⋮ New filtering for the cumulative constraint in the context of non-overlapping rectangles ⋮ Bucket elimination for multiobjective optimization problems ⋮ Achieving Domain Consistency and Counting Solutions for Dispersion Constraints ⋮ New exact techniques applied to a class of network flow formulations ⋮ On the usefulness of linear modular arithmetic in constraint programming
This page was built for publication: A dynamic programming approach for consistency and propagation for knapsack constraints
