Optimal sharing

DOI10.1007/BF01583798zbMath0482.90025OpenAlexW4238748775MaRDI QIDQ3941156

Toshio Nishida, Tetsuo Ichimori, Hiroaki Ishii

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01583798

zbMATH Keywords

algorithmscomputational complexitymaximum flowoptimal sharingcapacity-constrained distribution networkequitable resource distributionsharing method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Related Items (12)

Linear and combinatorial sharing problems ⋮ A solution to the random assignment problem on the full preference domain ⋮ Fair-by-design matching ⋮ On the solution of discrete bottleneck problems ⋮ Two algorithms for maximizing a separable concave function over a polymatroid feasible region ⋮ Reshipments and overshipments in transportation problems with minimax objective ⋮ A submodular optimization problem with side constraints ⋮ Flow sharing and bankruptcy games ⋮ A strongly polynomial time algorithm for a constrained submodular optimization problem ⋮ Towards equitable distribution via proportional equity constraints ⋮ Fuzzy sharing problem ⋮ The balanced linear programming problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing maximum flows in linear graphs
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME
• Optimal flows in networks with multiple sources and sinks
• A good algorithm for lexicographically optimal flows in multi-terminal networks
• The Sharing Problem

This page was built for publication: Optimal sharing