Cost based filtering for the constrained knapsack problem
From MaRDI portal
Publication:1854754
DOI10.1023/A:1021193019522zbMath1013.90105MaRDI QIDQ1854754
Torsten Fahle, Meinolf Sellmann
Publication date: 27 January 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
constraint programmingreduction algorithmsoptimization constraintsconstrained knapsack problemscost based filtering
Related Items
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, Cost-based filtering for shorter path constraints, Weighted matching as a generic pruning technique applied to optimization constraints, Constraint programming-based column generation, 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, Constraint programming-based column generation, Avoiding redundant columns by adding classical Benders cuts to column generation subproblems, Approximated consistency for the automatic recording constraint, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
Uses Software
