A note on specialized versus unspecialized methods for maximum-flow problems

DOI10.1002/NAV.3800310108MaRDI QIDQ3316929zbMATH OpenOpenAlexFDO

Authors Fred Glover, Melissa Mead, John Mote, Darwin D. Klingman

Publication date 1984

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800310108

zbMATH Keywords

comparison of algorithmslabel treemaximum flow problemnetwork flowprimal simplex

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• A primal simplex variant for the maximum-flow problem
• scientific article; zbMATH DE number 795215
• Design and Implementation of Data Structures for Generalized Networks
• scientific article; zbMATH DE number 4174642
• On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem

Cited in

(1)

• A specialized network simplex algorithm for the constrained maximum flow problem

This page was built for publication: A note on specialized versus unspecialized methods for maximum-flow problems

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