An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems

DOI10.1002/net.22082zbMath1528.90051OpenAlexW3214555511MaRDI QIDQ6087567

J. Cole Smith, Unnamed Author

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22082

zbMATH Keywords

linear programmingnetwork optimizationmaximum flow problemnode capacities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Linear programming (90C05) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
• Equivalence of the primal and dual simplex algorithms for the maximum flow problem
• On strongly polynomial dual simplex algorithms for the maximum flow problem
• Strongly polynomial dual simplex methods for the maximum flow problem
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• A Fast and Simple Algorithm for the Maximum Flow Problem
• Maximal Flow Through a Network
• Some Recent Advances in Network Flows
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• On the history of the transportation and maximum flow problems

This page was built for publication: An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems