Pages that link to "Item:Q1396817"
From MaRDI portal
The following pages link to Extending Dantzig's bound to the bounded multiple-class binary knapsack problem (Q1396817):
Displaying 6 items.
- Branching in branch-and-price: A generic scheme (Q652288) (← links)
- Knapsack problems with setups (Q1041933) (← links)
- Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- A Minimal Algorithm for the Bounded Knapsack Problem (Q4427321) (← links)
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)