Heuristic and reduction algorithms for the knapsack sharing problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A Max-Min Allocation Problem: Its Solutions and Applications
- A linear-time algorithm for solving continuous maximin knapsack problems
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- Minimax resource allocation problems: Optimization and parametric analysis
- More on Min-Max Allocation
- On Marginal Allocation in Single Constraint Min-Max Problems
- Reduction Algorithm for Zero-One Single Knapsack Problems
- The Knapsack Sharing Problem
Cited in
(11)- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
- DP-based algorithm and FPTAS for the knapsack sharing and related problems
- New upper bounds and exact methods for the knapsack sharing problem
- Cooperative strategies for solving the bicriteria sparse multiple knapsack problem
- An exact algorithm for the knapsack sharing problem
- An efficient algorithm for the knapsack sharing problem
- An exact algorithm for the knapsack sharing problem with common items
- An exact constructive algorithm for the knapsack sharing problem
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
- Bounded knapsack sharing
- Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds
This page was built for publication: Heuristic and reduction algorithms for the knapsack sharing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366711)
