A POLYNOMIAL ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM WITH A CONSTANT BALANCING RATE FUNCTION
From MaRDI portal
Publication:3030554
DOI10.15807/JORSJ.29.400zbMATH Open0626.90024OpenAlexW2333331687MaRDI QIDQ3030554FDOQ3030554
Authors: Akira Nakayama 
Publication date: 1986
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.29.400
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
Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Cited In (12)
- The linear balancing flow problem
- Balanced network flows. III. Strongly polynomial augmentation algorithms
- Max-balanced flows in oriented matroids
- A POLYNOMIAL-TIME BINARY SEARCH ALGORITHM FOR THE MAXIMUM BALANCED FLOW PROBLEM
- TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM
- Characterizations of max-balanced flows
- A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM
- Balancing problems in acyclic networks
- A method for obtaining the maximum \((\delta ,\eta )\)-balanced flow in a network
- Balancing Applied to Maximum Network Flow Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
