Pages that link to "Item:Q1665694"
From MaRDI portal
The following pages link to Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound (Q1665694):
Displaying 9 items.
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
- An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities (Q2362175) (← links)
- Optimization of energy distribution in solar panel array configurations by graphs and Minkowski's paths (Q2422885) (← links)
- A column-generation approach to the multiple knapsack problem with color constraints (Q2892278) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
- An Improved Knapsack Solver for Column Generation (Q4928469) (← links)