Cost based filtering for the constrained knapsack problem
From MaRDI portal
(Redirected from Publication:1854754)
Recommendations
- Approximated consistency for knapsack constraints
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- scientific article; zbMATH DE number 1973871
- A dynamic programming approach for consistency and propagation for knapsack constraints
- An efficient algorithm for the collapsing knapsack problem
Cited in
(15)- Approximated consistency for the automatic recording constraint
- Constraint programming for stochastic inventory systems under shortage cost
- The weighted arborescence constraint
- A first look at picking dual variables for maximizing reduced cost fixing
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Cost-based filtering for shorter path constraints
- Exact solution of graph coloring problems via constraint programming and column generation
- Weighted matching as a generic pruning technique applied to optimization constraints
- Approximated consistency for knapsack constraints
- Constraint programming-based column generation
- Constraint programming-based column generation
- The theory of Lagrangian filtering zones: a case study on the knapsack constraint
- Cost-based filtering techniques for stochastic inventory control under service level constraints
- The TV-break packing problem
- A \texttt{cost-regular} based hybrid column generation approach
This page was built for publication: Cost based filtering for the constrained knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854754)
