FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME

DOI10.15807/jorsj.23.268zbMath0444.90033OpenAlexW2729624260MaRDI QIDQ3888814

Toshio Nishida, Tetsuo Ichimori, Hiroaki Ishii

Publication date: 1980

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.23.268

zbMATH Keywords

computational complexitypolynomial algorithmmaximum flowbinary searchcapacity modificationweighted minimax flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items (4)

Linear and combinatorial sharing problems ⋮ On the solution of discrete bottleneck problems ⋮ The balanced linear programming problem ⋮ Optimal sharing

This page was built for publication: FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME