Recommendations
- New upper bounds and exact methods for the knapsack sharing problem
- Knapsack cost sharing
- The knapsack sharing problem: an exact algorithm
- An exact algorithm for large knapsack sharing problems
- An exact algorithm for the knapsack sharing problem
- An efficient algorithm for the knapsack sharing problem
- An exact constructive algorithm for the knapsack sharing problem
- Solving knapsack sharing problems with general tradeoff functions
- An exact algorithm for the knapsack sharing problem with common items
- Heuristic and reduction algorithms for the knapsack sharing problem
Cites work
- A lexicographic minimax algorithm for multiperiod resource allocation
- A nonlinear minimax allocation problem with multiple knapsack constraints
- An algorithm for separable nonlinear minimax problems
- Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
- Minimax Resource Allocation with Tree Structured Substitutable Resources
- Resource allocation among competing activities: A lexicographic minimax approach
- Solving knapsack sharing problems with general tradeoff functions
- The Knapsack Sharing Problem
- The Linear Sharing Problem
Cited in
(6)- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- The Linear Sharing Problem
- Linear and combinatorial sharing problems
- An equitable bandwidth allocation model for video-on-demand networks
- An exact algorithm for the knapsack sharing problem with common items
- Sharing problems
This page was built for publication: Bounded knapsack sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804651)
