Pages that link to "Item:Q1130040"
From MaRDI portal
The following pages link to Bounds for nested knapsack problems (Q1130040):
Displaying 6 items.
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
- Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
- An integer linear optimization model to the compartmentalized knapsack problem (Q6088172) (← links)
