Pages that link to "Item:Q702349"
From MaRDI portal
The following pages link to The knapsack sharing problem: an exact algorithm (Q702349):
Displaying 14 items.
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
- Heuristic and reduction algorithms for the knapsack sharing problem (Q1366711) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- Bounded knapsack sharing (Q1804651) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item (Q2384607) (← links)
- New upper bounds and exact methods for the knapsack sharing problem (Q2396494) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study (Q2883592) (← links)
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item (Q3502135) (← links)
- An exact constructive algorithm for the knapsack sharing problem (Q4594846) (← links)
- An exact algorithm for large knapsack sharing problems (Q5883603) (← links)
- Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds (Q6660109) (← links)