NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING

DOI10.15807/jorsj.46.243zbMath1042.90050OpenAlexW2127342033MaRDI QIDQ4444093

Satoru Fujishige, Shigueo Isotani

Publication date: 2003

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

zbMATH Keywords

graph connectivitymaximum capacitymaximum adjacency

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (3)

Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ The MA-ordering max-flow algorithm is not strongly polynomial for directed networks ⋮ Soft arc consistency revisited

This page was built for publication: NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING