Network flow algorithms
DOI10.1017/9781316888568zbMATH Open1426.90003OpenAlexW4211250771MaRDI QIDQ5377010FDOQ5377010
Authors: David P. Williamson 
Publication date: 21 May 2019
Full work available at URL: https://doi.org/10.1017/9781316888568
Recommendations
Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Flows in graphs (05C21) Applications of graph theory to circuits and networks (94C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (24)
- Electrical flows over spanning trees
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- New algorithms for generalized network flows
- Non-interfering network flows
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
- Single source unsplittable flows with arc-wise lower and upper bounds
- Title not available (Why is that?)
- Efficient large-scale multi-drone delivery using transit networks
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- Algorithms for dynamic NFV workload
- Network as a Computer: Ranking Paths to Find Flows
- Minimum cost flow problem
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Single source unsplittable flows with arc-wise lower and upper bounds
- ReLU neural networks of polynomial size for exact maximum flow computation
- Finding optimal non-datapath caching strategies via network flow
- Online unrelated-machine load balancing and generalized flow with recourse
- On the motion of substance in a channel and growth of random networks
- Scalable timing-aware network design via Lagrangian decomposition
- Network flows. Theory, algorithms, and applications.
- A comparison of phase and nonphase network flow algorithms
- Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems
This page was built for publication: Network flow algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377010)
