Network flow algorithms
From MaRDI portal
Flows in graphs (05C21) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)
Recommendations
Cited in
(37)- Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms
- New algorithms for generalized network flows
- Algorithms for dynamic NFV workload
- On the motion of substance in a channel and growth of random networks
- Electrical flows over spanning trees
- Single source unsplittable flows with arc-wise lower and upper bounds
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- Finding optimal non-datapath caching strategies via network flow
- Network flows. Theory, algorithms, and applications.
- Network as a Computer: Ranking Paths to Find Flows
- A comparison of phase and nonphase network flow algorithms
- scientific article; zbMATH DE number 42283 (Why is no real title available?)
- scientific article; zbMATH DE number 614356 (Why is no real title available?)
- scientific article; zbMATH DE number 1156584 (Why is no real title available?)
- Minimum cost flow problem
- scientific article; zbMATH DE number 218386 (Why is no real title available?)
- Single source unsplittable flows with arc-wise lower and upper bounds
- Non-interfering network flows
- Efficient large-scale multi-drone delivery using transit networks
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems
- ReLU neural networks of polynomial size for exact maximum flow computation
- Scalable timing-aware network design via Lagrangian decomposition
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- Online unrelated-machine load balancing and generalized flow with recourse
- A linear delay algorithm of enumerating strongly-connected induced subgraphs based on SSD set system
- Integer and unsplittable multiflows in series-parallel digraphs
- Minimum-peak-cost flows over time
- Reconfiguration of multisets with applications to bin packing
- The double regularization method for capacity constrained optimal transport
- The minimum-cost dynamic flow problem in a fixed graph with a constant target flow value
- A \(\frac{4}{3} \)-approximation algorithm for half-integral cycle cut instances of the TSP
- ReLU neural networks of polynomial size for exact maximum flow computation
- A linear-delay algorithm for enumerating strongly-connected induced subgraphs based on SSD set system
- An optimal algorithm for the stacker crane problem on fixed topologies
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)
