A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM

DOI10.15807/JORSJ.31.551MaRDI QIDQ3818096zbMATH OpenOpenAlexFDO

Authors Wentian Cui

Publication date 1988

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.31.551

zbMATH Keywords

maximum balanced flowmaximum balanced integral flow problemnetwork simplex methodpolynomial- timesource-to-sink networkstrong feasibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Linear programming (90C05)

Recommendations

• A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION
• TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
• Balancing Applied to Maximum Network Flow Problems
• A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM
• A strongly polynomial algorithm for the uniform balanced network flow problem

Cited in

(26)

• On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem
• Use of dynamic trees in a network simplex algorithm for the maximum flow problem
• The balanced linear programming problem
• On the complexity of the dual method for maximum balanced flows
• Balancing problems in acyclic networks
• A strongly polynomial algorithm for the uniform balanced network flow problem
• Network simplex algorithm for the general equal flow problem.
• Maximum balanced flow in a network
• A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
• A simplex algorithm for network flow problems with piecewise linear fractional objective function
• Balanced network flows. VII: Primal-dual algorithms.
• Network simplex algorithm for the bi-criteria minimum cost flow over time problem
• A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION
• A method for obtaining the maximum ( , )-balanced flow in a network
• A primal simplex variant for the maximum-flow problem
• A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM
• scientific article; zbMATH DE number 3934732 (Why is no real title available?)
• NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM
• scientific article; zbMATH DE number 653269 (Why is no real title available?)
• TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
• Balanced network flows. III. Strongly polynomial augmentation algorithms
• A specialized network simplex algorithm for the constrained maximum flow problem
• Balancing Applied to Maximum Network Flow Problems
• The in-out rebalancing flow method for maximum flow computation
• Duality for balanced submodular flows
• The linear balancing flow problem

This page was built for publication: A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM

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