On the public citation graph

A survey on exact algorithms for the maximum flow and minimum‐cost flow problems

https://doi.org/10.1002/net.22169
0 signed · 80 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.22001openalex-snapshot
A fast maximum flow algorithm
inferredcites →https://doi.org/10.1002/net.3230010206openalex-snapshot
On some techniques useful for solution of transportation network problems
inferredcites →https://doi.org/10.1006/jagm.1994.1044openalex-snapshot
A Faster Deterministic Maximum Flow Algorithm
inferredcites →https://doi.org/10.1007/978-3-662-56039-6openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf00264254openalex-snapshot
An O(V 5/3 E 2/3) algorithm for the maximal flow problem
inferredcites →https://doi.org/10.1007/bf01580882openalex-snapshot
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
inferredcites →https://doi.org/10.1007/bf01585705openalex-snapshot
Finding minimum-cost flows by double scaling
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bfb0032035openalex-snapshot
Can a maximum flow be computed in o(nm) time?
inferredcites →https://doi.org/10.1007/pl00009180openalex-snapshot
On Implementing the Push—Relabel Method for the Maximum Flow Problem
inferredcites →https://doi.org/10.1007/pl00009214openalex-snapshot
On-Line Load Balancing and Network Flow
inferredcites →https://doi.org/10.1016/0020-0190(90)90024-ropenalex-snapshot
Generating pseudo-random permutations and maximum flow algorithms
inferredcites →https://doi.org/10.1016/0022-0000(80)90035-5openalex-snapshot
An O(EVIog2V) algorithm for the maximal flow problem
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.003openalex-snapshot
Integer priority queues with decrease key in constant time and the single source shortest paths problem
inferredcites →https://doi.org/10.1016/s0377-2217(96)00269-xopenalex-snapshot
Computational investigations of maximum flow algorithms
inferredcites →https://doi.org/10.1016/s0927-0507(05)12001-5openalex-snapshot
On the History of Combinatorial Optimization (Till 1960)
inferredcites →https://doi.org/10.1017/9781316888568openalex-snapshot
Network Flow Algorithms
inferredcites →https://doi.org/10.1057/jors.1981.67openalex-snapshot
Discrete Structures and Algorithms
inferredcites →https://doi.org/10.1080/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferredcites →https://doi.org/10.1090/dimacs/012/06openalex-snapshot
An empirical study of Min cost flow algorithms
inferredcites →https://doi.org/10.1098/rspa.1960.0144openalex-snapshot
Monotone networks
inferredcites →https://doi.org/10.1109/focs.2014.52openalex-snapshot
Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow
inferredcites →https://doi.org/10.1109/focs.2016.70openalex-snapshot
Computing Maximum Flow with Augmenting Electrical Flows
inferredcites →https://doi.org/10.1109/focs46700.2020.00111openalex-snapshot
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
inferredcites →https://doi.org/10.1109/focs54457.2022.00064openalex-snapshot
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
inferredcites →https://doi.org/10.1109/sfcs.1978.5openalex-snapshot
A new algorithm for the maximal flow problem
inferredcites →https://doi.org/10.1109/sfcs.1984.715934openalex-snapshot
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
inferredcites →https://doi.org/10.1109/sfcs.1989.63465openalex-snapshot
A randomized maximum-flow algorithm
inferredcites →https://doi.org/10.1137/0109002openalex-snapshot
An Out-of-Kilter Method for Minimal-Cost Flow Problems
inferredcites →https://doi.org/10.1137/0218065openalex-snapshot
Improved Time Bounds for the Maximum Flow Problem
inferredcites →https://doi.org/10.1137/0218069openalex-snapshot
Faster Scaling Algorithms for Network Problems
inferredcites →https://doi.org/10.1137/1.9780898717754openalex-snapshot
Assignment Problems
inferredcites →https://doi.org/10.1137/1.9781611976465.33openalex-snapshot
Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
inferredcites →https://doi.org/10.1137/s0097539791278376openalex-snapshot
An $o(n^3 )$-Time Maximum-Flow Algorithm
inferredcites →https://doi.org/10.1145/1374376.1374441openalex-snapshot
Faster approximate lossy generalized flow via interior point algorithms
inferredcites →https://doi.org/10.1145/167088.167201openalex-snapshot
Online load balancing and network flow
inferredcites →https://doi.org/10.1145/2628036openalex-snapshot
Efficient maximum flow algorithms
inferredcites →https://doi.org/10.1145/290179.290181openalex-snapshot
Beyond the flow decomposition barrier
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/3357713.3384247openalex-snapshot
Faster energy maximization for faster maximum flow
inferredcites →https://doi.org/10.1145/3406325.3451108openalex-snapshot
Minimum cost flows, MDPs, and ℓ 1 -regression in nearly linear time for dense instances
inferredcites →https://doi.org/10.1145/3519935.3520068openalex-snapshot
Faster maxflow via improved dynamic spectral vertex sparsifiers
inferredcites →https://doi.org/10.1145/42282.214090openalex-snapshot
An O (n 2 (m + N log n )log n ) min-cost flow algorithm
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1287/mnsc.14.3.205openalex-snapshot
A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
inferredcites →https://doi.org/10.1287/mnsc.2.3.276openalex-snapshot
The Transhipment Problem
inferredcites →https://doi.org/10.1287/moor.15.3.430openalex-snapshot
Finding Minimum-Cost Circulations by Successive Approximation
inferredcites →https://doi.org/10.1287/opre.1080.0572openalex-snapshot
A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
inferredcites →https://doi.org/10.1287/opre.37.5.748openalex-snapshot
A Fast and Simple Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.1287/opre.41.2.338openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferredcites →https://doi.org/10.1515/9781400875184openalex-snapshot
Flows in Networks
inferredcites →https://doi.org/10.21236/ad0249662openalex-snapshot
A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS
inferredcites →https://doi.org/10.21236/ada214498openalex-snapshot
Finding Minimum-Cost Flows by Double Scaling
inferredcites →https://doi.org/10.21236/ada457044openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/pamm.202200224openalex-snapshot
Modeling Minimum Cost Network Flows With Port‐Hamiltonian Systems
inferred← citeshttps://doi.org/10.1007/s10958-025-07812-2openalex-snapshot
BALANCED NETWORKS AND GRAPHS
inferred← citeshttps://doi.org/10.1016/b978-0-44-330221-3.00019-3openalex-snapshot
Infrastructure systems: from reliability to resilience
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100867openalex-snapshot
Interdiction in network maximum flow and related problems: A survey
inferred← citeshttps://doi.org/10.1016/j.ifacol.2024.07.539openalex-snapshot
Advancements in Home Energy Management Systems: A Review of Energy Optimization Strategies and Algorithmic Approaches
inferred← citeshttps://doi.org/10.1016/j.jenvman.2024.122062openalex-snapshot
A novel longitudinal connectivity index to evaluate reticular river networks based on the combination of network maximum flow and resistance distance
inferred← citeshttps://doi.org/10.1016/j.ress.2025.111870openalex-snapshot
Seismic resilience assessment and post-earthquake recovery strategy of substations based on maximum flow theory
inferred← citeshttps://doi.org/10.1080/23249935.2025.2564218openalex-snapshot
Network path redundancy enhancement: a bi-level stochastic model and exact algorithms
inferred← citeshttps://doi.org/10.1080/23302674.2023.2280984openalex-snapshot
On inequality constraints in well-known optimisation problems: properties and applications
inferred← citeshttps://doi.org/10.1109/access.2023.3336410openalex-snapshot
Double-Blind Proof of Existence for Decentralized Identities
inferred← citeshttps://doi.org/10.1109/aceee66257.2025.11149246openalex-snapshot
Seismic Performance Assessment and Enhancement Strategy for UHV Converter Stations
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386845openalex-snapshot
Maximum Flow on Highly Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/edm69524.2026.11632017openalex-snapshot
Uncertainty-Aware Predictive Resource Sharing in 5G Heterogeneous Networks: A Bayesian Neural Network and Minimum-Cost Flow Approach
inferred← citeshttps://doi.org/10.1109/jiot.2025.3571185openalex-snapshot
Privacy-Preserving Multitask Online Matching in Mobile Crowdsensing: A Snapshot-Based Approach
inferred← citeshttps://doi.org/10.1109/rtss62706.2024.00037openalex-snapshot
FRAP: A Flexible Resource Accessing Protocol for Multiprocessor Real-Time Systems
inferred← citeshttps://doi.org/10.1145/3679240.3734593openalex-snapshot
Optimizing Electric Vehicle Scheduling with Charging Guarantees using Flow Models with Local Penalties
inferred← citeshttps://doi.org/10.1287/opre.2024.1044openalex-snapshot
Relating Electric Vehicle Charging to Speed Scaling with Job-Specific Speed Limits
inferred← citeshttps://doi.org/10.1609/aaai.v38i16.29676openalex-snapshot
Improved Anonymous Multi-Agent Path Finding Algorithm
inferred← citeshttps://doi.org/10.2139/ssrn.7268520openalex-snapshot
Ecological water replenishment drives the coupling and decoupling of structural and biological connectivity along an urban–rural gradient
inferred← citeshttps://doi.org/10.31436/iiumej.v25i2.3063openalex-snapshot
Operational Cost Models for an Earth Station System Using 2-Parallel and 4-Parallel Configurations
inferred← citeshttps://doi.org/10.3390/app14052023openalex-snapshot
A Method for Modeling and Testing Near-Real-Time System Scenarios
inferred← citeshttps://doi.org/10.3390/futuretransp6040162openalex-snapshot
Cargo-Specific Multimodal Freight Transport Performance Assessment Using a Minimum-Cost Flow Framework in Laos
inferred← citeshttps://doi.org/10.3390/math13142234openalex-snapshot
Simple k-Crashing Plan with a Good Approximation Ratio
inferred← citeshttps://doi.org/10.3390/math13193112openalex-snapshot
Max-Min Fair Restoration of Infrastructure Networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.