WEIGHTED MINIMAX REAL-VALUED FLOWS
DOI10.15807/JORSJ.24.52zbMATH Open0454.90081OpenAlexW2331834944MaRDI QIDQ3902855FDOQ3902855
Authors: Tetsuo Ichimori, Toshio Nishida, Hiroaki Ishii
Publication date: 1981
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.24.52
polynomial algorithmcapacity modification techniqueratio minimization problemweighted minimal real-valued flows
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Cited In (7)
- Convergence and correctness of belief propagation for weighted min-max flow
- The continuous maximum capacity path interdiction problem
- Linear and combinatorial sharing problems
- The balanced linear programming problem
- Reshipments and overshipments in transportation problems with minimax objective
- On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem
- On the solution of discrete bottleneck problems
This page was built for publication: WEIGHTED MINIMAX REAL-VALUED FLOWS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902855)