An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
From MaRDI portal
Recommendations
- New algorithm for maximum flow algorithm in network with both node and edge capacity confined
- On the maximum capacity augmentation algorithm for the maximum flow problem
- Multi-terminal maximum flows in node-capacitated networks
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
- The Maximum Energy-Constrained Dynamic Flow Problem
Cites work
- A Fast and Simple Algorithm for the Maximum Flow Problem
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- A suggested computation for maximal multi-commodity network flows
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
- Equivalence of the primal and dual simplex algorithms for the maximum flow problem
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
- Maximal Flow Through a Network
- Network flows. Theory, algorithms, and applications.
- On strongly polynomial dual simplex algorithms for the maximum flow problem
- On the history of the transportation and maximum flow problems
- Some Recent Advances in Network Flows
- Strongly polynomial dual simplex methods for the maximum flow problem
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This page was built for publication: An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087567)
