An algorithm for the fair resource allocation problem with a submodular constraint

DOI10.1007/BF03167143zbMath0747.90070MaRDI QIDQ1179783

Kenji Namikawa, Toshihide Ibaraki

Publication date: 27 June 1992

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

submodular constraintscontinuous versionfair resource allocation problem

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Minimization of maximum absolute deviation in integers
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Submodular functions and optimization
• An Algorithm for the Equipollent Resource Allocation Problem
• Submodular systems and related topics
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• The Fair Resource Allocation Problem with Submodular Constraints
• Polymatroidal flow network models with multiple sinks
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Technical Note—Allocation of Effort Resources among Competing Activities
• The Sharing Problem
• Technical Note—Comment on an Integer Maximization Problem