The linear balancing flow problem

DOI10.1016/0377-2217(93)90009-CMaRDI QIDQ684332zbMATH OpenOpenAlexFDO

Authors Giovanni Andreatta, Carlo Filippi, Giorgio Romanin-Jacur

Publication date 15 September 1993

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(93)90009-c

zbMATH Keywords

bipartite network with gainslinear balancing flow problemreal-life production plan

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• The balanced linear programming problem
• A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
• TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
• A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION
• Balancing Applied to Maximum Network Flow Problems

Cites work

• Algorithms for the minimax transportation problem
• Balanced optimization problems
• The bottleneck transportation problem

Cited in

(2)

• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• Balancing problems in acyclic networks

This page was built for publication: The linear balancing flow problem

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