NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING

DOI10.15807/JORSJ.46.243MaRDI QIDQ4444093zbMATH OpenOpenAlexFDO

Authors 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 adjacencymaximum capacity

Mathematics Subject Classification ID

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

Recommendations

• A maximum flow algorithm using MA ordering.
• PRACTICAL EFFICIENCY OF MAXIMUM FLOW ALGORITHMS USING MA ORDERINGS AND PREFLOWS
• The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
• Improved Time Bounds for the Maximum Flow Problem
• A Fast and Simple Algorithm for the Maximum Flow Problem

Cited in

(6)

• The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
• A maximum flow algorithm using MA ordering.
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
• PRACTICAL EFFICIENCY OF MAXIMUM FLOW ALGORITHMS USING MA ORDERINGS AND PREFLOWS
• Graph connectivity and its augmentation: Applications of MA orderings
• Soft arc consistency revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4444093)