Optimal sharing

DOI10.1007/BF01583798MaRDI QIDQ3941156zbMATH OpenOpenAlexFDO

Authors Tetsuo Ichimori, Toshio Nishida, 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

algorithmscapacity-constrained distribution networkcomputational complexityequitable resource distributionmaximum flowoptimal sharingsharing method

Mathematics Subject Classification ID

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

Cites work

• A good algorithm for lexicographically optimal flows in multi-terminal networks
• FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3750964 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3634041 (Why is no real title available?)
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Minimizing maximum flows in linear graphs
• Optimal flows in networks with multiple sources and sinks
• The Sharing Problem

Cited in

(12)

• Linear and combinatorial sharing problems
• 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
• Fuzzy sharing problem
• The balanced linear programming problem
• Towards equitable distribution via proportional equity constraints
• Fair-by-design matching
• A submodular optimization problem with side constraints
• Flow sharing and bankruptcy games
• A strongly polynomial time algorithm for a constrained submodular optimization problem
• A solution to the random assignment problem on the full preference domain

This page was built for publication: Optimal sharing

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