An exact algorithm for the knapsack sharing problem with common items
From MaRDI portal
Publication:817562
DOI10.1016/j.ejor.2004.09.036zbMath1090.90162OpenAlexW1984555447MaRDI QIDQ817562
Publication date: 16 March 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.036
Related Items (10)
The Subset Sum game ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ An exact decomposition algorithm for the generalized knapsack sharing problem ⋮ Strategies in competing subset selection ⋮ Competitive subset selection with two agents ⋮ Maximin fairness in project budget allocation ⋮ Heuristic solution approaches for the maximum minsum dispersion problem ⋮ Price of fairness for allocating a bounded resource ⋮ A new method for multiple attribute group decision-making with intuitionistic trapezoid fuzzy linguistic information ⋮ A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The knapsack sharing problem: an exact algorithm
- Minimax resource allocation problems: Optimization and parametric analysis
- A branch-and-bound algorithm for the mini-max spanning forest problem
- Heuristic and reduction algorithms for the knapsack sharing problem
- Bounded knapsack sharing
- Minimax and applications
- A linear-time algorithm for solving continuous maximin knapsack problems
- Discrete Dynamic Programming and Capital Allocation
- A Max-Min Allocation Problem: Its Solutions and Applications
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Computing Partitions with Applications to the Knapsack Problem
- The Knapsack Sharing Problem
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
This page was built for publication: An exact algorithm for the knapsack sharing problem with common items
