Pages that link to "Item:Q1122484"
From MaRDI portal
The following pages link to The knapsack problem with generalized upper bounds (Q1122484):
Displaying 5 items.
- \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026) (← links)
- Limiting the number of each piece in two-dimensional cutting stock patterns (Q1197090) (← links)
- The continuous knapsack problem with capacities (Q2059181) (← links)
- A well-solvable special case of the bounded knapsack problem (Q2275577) (← links)
- (Q3138272) (← links)