An exact algorithm for the knapsack sharing problem with common items

DOI10.1016/J.EJOR.2004.09.036MaRDI QIDQ817562zbMATH OpenOpenAlexFDO

Authors Masako Fujimoto, Takeo Yamada

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

zbMATH Keywords

Knapsack problemcombinational optimizationKnapsack sharing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• An exact decomposition algorithm for the generalized knapsack sharing problem
• An efficient algorithm for the knapsack sharing problem
• An exact algorithm for large knapsack sharing problems
• An exact algorithm for the knapsack sharing problem
• The knapsack sharing problem: an exact algorithm

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Max-Min Allocation Problem: Its Solutions and Applications
• A branch-and-bound algorithm for the mini-max spanning forest problem
• A linear-time algorithm for solving continuous maximin knapsack problems
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• Bounded knapsack sharing
• Computing Partitions with Applications to the Knapsack Problem
• Discrete dynamic programming and capital allocation
• Heuristic and reduction algorithms for the knapsack sharing problem
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Minimax and applications
• Minimax resource allocation problems: Optimization and parametric analysis
• The Knapsack Sharing Problem
• The knapsack sharing problem: an exact algorithm

Cited in

(14)

• A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
• Heuristic solution approaches for the maximum minsum dispersion problem
• DP-based algorithm and FPTAS for the knapsack sharing and related problems
• Competitive subset selection with two agents
• Price of fairness for allocating a bounded resource
• Strategies in competing subset selection
• An efficient algorithm for the knapsack sharing problem
• An exact decomposition algorithm for the generalized knapsack sharing problem
• A new method for multiple attribute group decision-making with intuitionistic trapezoid fuzzy linguistic information
• Some extended knapsack problems involving job partition between two parties
• Maximin fairness in project budget allocation
• Bounded knapsack sharing
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• The Subset Sum game

This page was built for publication: An exact algorithm for the knapsack sharing problem with common items

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817562)