Pages that link to "Item:Q1861937"
From MaRDI portal
The following pages link to A dynamic programming approach for consistency and propagation for knapsack constraints (Q1861937):
Displayed 17 items.
- Tractability-preserving transformations of global cost functions (Q309935) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- A parametric propagator for pairs of \textsc{Sum} constraints with a discrete convexity property (Q334808) (← links)
- New filtering for the cumulative constraint in the context of non-overlapping rectangles (Q545536) (← links)
- Power of pre-processing: production scheduling with variable energy pricing and power-saving states (Q823779) (← links)
- New filtering algorithms for combinations of among constraints (Q842795) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs (Q1706596) (← links)
- A constraint programming approach for a batch processing problem with non-identical job sizes (Q1926887) (← links)
- New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
- On the usefulness of linear modular arithmetic in constraint programming (Q2117225) (← links)
- Bucket elimination for multiobjective optimization problems (Q2506234) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- Achieving Domain Consistency and Counting Solutions for Dispersion Constraints (Q2802248) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles (Q5387618) (← links)
- Counting Solutions of Knapsack Constraints (Q5387631) (← links)