The flow circulation sharing problem

DOI10.1007/BF02591771zbMath0507.90026OpenAlexW2060701603MaRDI QIDQ4745580

J. Randall Brown

Publication date: 1983

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

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

zbMATH Keywords

optimality conditionslower and upper boundscomputational experienceequitable resource allocationefficient algorithmknapsack sharingmaximin objective functionflow circulation sharing problemregular arcstradeoff arcs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items (6)

Linear and combinatorial sharing problems ⋮ A nonlinear minimax allocation problem with multiple knapsack constraints ⋮ Reshipments and overshipments in transportation problems with minimax objective ⋮ Optimality conditions for distributive justice ⋮ The balanced linear programming problem ⋮ Solving knapsack sharing problems with general tradeoff functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• An improved version of the out-of-kilter method and a comparative study of computer codes
• On Algorithms for Enumerating All Circuits of a Graph
• The Sharing Problem
• The Knapsack Sharing Problem

This page was built for publication: The flow circulation sharing problem