The knapsack sharing problem: an exact algorithm
From MaRDI portal
Recommendations
- An exact algorithm for the knapsack sharing problem
- An exact decomposition algorithm for the generalized knapsack sharing problem
- An exact algorithm for large knapsack sharing problems
- An exact constructive algorithm for the knapsack sharing problem
- New upper bounds and exact methods for the knapsack sharing problem
Cited in
(15)- Heuristic and reduction algorithms for the knapsack sharing problem
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- Bounded knapsack sharing
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
- New upper bounds and exact methods for the knapsack sharing problem
- An exact algorithm for the knapsack sharing problem
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
- An exact decomposition algorithm for the generalized knapsack sharing problem
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
- An exact constructive algorithm for the knapsack sharing problem
- DP-based algorithm and FPTAS for the knapsack sharing and related problems
- An exact algorithm for large knapsack sharing problems
- Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds
- An exact algorithm for the knapsack sharing problem with common items
This page was built for publication: The knapsack sharing problem: an exact algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702349)