A primal simplex variant for the maximum-flow problem

DOI10.1002/nav.3800310107zbMath0533.90033OpenAlexW1989577638MaRDI QIDQ3316928

John Mote, Fred Glover, David Whitman, 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.3800310107

zbMATH Keywords

update techniquesnetwork flowcomparison of algorithmscomputational evaluationnumerical studyprimal simplexmaximum flow problemslabel tree

Mathematics Subject Classification ID

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

Related Items

Solving matching problems with linear programming, A cutting plane algorithm for minimum perfect 2-matchings, Computational investigations of maximum flow algorithms, Implementing Goldberg's max-flow-algorithm ? A computational investigation, Solution of large-scale symmetric travelling salesman problems

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal Flow Through a Network
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Pivot Strategies for Primal-Simplex Network Codes