A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION
From MaRDI portal
Publication:3030554
Recommendations
- A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
- A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM
- TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
- Balancing Applied to Maximum Network Flow Problems
- Balanced network flows. III. Strongly polynomial augmentation algorithms
Cited in
(14)- Balanced network flows. III. Strongly polynomial augmentation algorithms
- Ratio-balanced maximum flows
- Characterizations of max-balanced flows
- A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM
- A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
- scientific article; zbMATH DE number 3934732 (Why is no real title available?)
- A method for obtaining the maximum \((\delta ,\eta )\)-balanced flow in a network
- The linear balancing flow problem
- Balancing problems in acyclic networks
- Balanced flows for transshipment problems
- scientific article; zbMATH DE number 1769330 (Why is no real title available?)
- Balancing Applied to Maximum Network Flow Problems
- Max-balanced flows in oriented matroids
- TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
This page was built for publication: A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030554)
