Pages that link to "Item:Q3863692"
From MaRDI portal
The following pages link to APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS (Q3863692):
Displayed 6 items.
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- Robust resource allocations in temporal networks (Q715076) (← links)
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- A dual approach for the continuous collapsing knapsack problem (Q3778543) (← links)