DP-based algorithm and FPTAS for the knapsack sharing and related problems

DOI10.15807/JORSJ.62.1MaRDI QIDQ5232595zbMATH OpenOpenAlexFDO

Authors Seiji Kataoka, Takeo Yamada

Publication date 12 September 2019

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.62.1

zbMATH Keywords

approximationcombinatorial optimizationDP-based algorithmFPTAS/PTASknapsack sharing problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Other game-theoretic models (91A40)

Recommendations

• Heuristic and reduction algorithms for the knapsack sharing problem
• An exact algorithm for the knapsack sharing problem
• The knapsack sharing problem: an exact algorithm
• An exact decomposition algorithm for the generalized knapsack sharing problem
• An exact algorithm for the knapsack sharing problem with common items

Cited in

(3)

• More effort towards multiagent knapsack
• Solving knapsack sharing problems with general tradeoff functions
• Some extended knapsack problems involving job partition between two parties

This page was built for publication: DP-based algorithm and FPTAS for the knapsack sharing and related problems

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