An Improved Knapsack Solver for Column Generation
From MaRDI portal
Recommendations
- A column generation method for the multiple-choice multi-dimensional knapsack problem
- A column-generation approach to the multiple knapsack problem with color constraints
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
- Column basis reduction and decomposable knapsack problems
- Accelerating column generation for variable sized bin-packing problems
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound
- Column-Generation in Integer Linear Programming
- Enhancing CP-based column generation for integer programs
- A technical review of column generation in integer programming
Cited in
(5)- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- A column-generation approach to the multiple knapsack problem with color constraints
- An improved approximation scheme for variable-sized bin packing
- Column basis reduction and decomposable knapsack problems
This page was built for publication: An Improved Knapsack Solver for Column Generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928469)