On the public citation graph
A computational comparison of the dinic and network simplex methods for maximum flow
0 signed · 111 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_15openalex-snapshot
Maximal Flow Through a Network
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/bf01580108openalex-snapshot
Pivot selection methods of the Devex LP code
inferredcites →https://doi.org/10.1007/bf01580122openalex-snapshot
More pathological examples for network flow problems
inferredcites →https://doi.org/10.1007/bf01593804openalex-snapshot
A practicable steepest-edge simplex algorithm
inferredcites →https://doi.org/10.1007/bfb0121089openalex-snapshot
An efficient implementation of the network simplex method
inferredcites →https://doi.org/10.1016/0012-365x(78)90011-0openalex-snapshot
A characterization of the minimum cycle mean in a digraph
inferredcites →https://doi.org/10.1016/0020-0190(78)90016-9openalex-snapshot
An O(|V|3) algorithm for finding maximum flows in networks
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/0166-218x(80)90045-1openalex-snapshot
An extended abstract of an indepth algorithmic and computational study for maximum flow problems
inferredcites →https://doi.org/10.1016/0167-6377(84)90076-2openalex-snapshot
A simple version of Karzanov's blocking flow algorithm
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/0196-6774(82)90013-xopenalex-snapshot
An O(n2log n) parallel max-flow algorithm
inferredcites →https://doi.org/10.1090/psapm/015/0161746openalex-snapshot
An experimental study of the simplex method
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/322063.322070openalex-snapshot
Pivot Strategies for Primal-Simplex Network Codes
inferredcites →https://doi.org/10.1145/355873.355874openalex-snapshot
Computational Comparison of Eight Methods for the Maximum Network Flow Problem
inferredcites →https://doi.org/10.1287/moor.4.2.196openalex-snapshot
Theoretical Properties of the Network Simplex Method
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
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/(sici)1097-0037(200003)35:2<91::aid-net1>3.0.co;2-topenalex-snapshot
A truncated primal-infeasible dual-feasible network interior point method
inferred← citeshttps://doi.org/10.1002/net.22149openalex-snapshot
Risk‐averse optimization and resilient network flows
inferred← citeshttps://doi.org/10.1002/net.3230230704openalex-snapshot
Sensitivity analysis in stochastic flow networks using the Monte Carlo method
inferred← citeshttps://doi.org/10.1007/11499251_10openalex-snapshot
Minimum-Cost Optimization in Multicommodity Logistic Chain Network
inferred← citeshttps://doi.org/10.1007/11561071_6openalex-snapshot
Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut
inferred← citeshttps://doi.org/10.1007/3-540-44867-5_9openalex-snapshot
Linear Time Local Improvements for Weighted Matchings in Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_25openalex-snapshot
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_49openalex-snapshot
On implementing push-relabel method for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-6075-0_4openalex-snapshot
Transportation-Oriented Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-20086-6_15openalex-snapshot
Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_16openalex-snapshot
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_39openalex-snapshot
The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02158-9_19openalex-snapshot
Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_39openalex-snapshot
Maximum Flows by Incremental Breadth-First Search
inferred← citeshttps://doi.org/10.1007/978-3-642-24264-9_13openalex-snapshot
The Maximum Flow Problem with Minimum Lot Sizes
inferred← citeshttps://doi.org/10.1007/978-3-642-29210-1_13openalex-snapshot
Inverse Shortest Path Models Based on Fundamental Cycle Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-29210-1_14openalex-snapshot
Parallel algorithms for the maximum flow problem with minimum lot sizes
inferred← citeshttps://doi.org/10.1007/978-3-642-77489-8_3openalex-snapshot
An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow
inferred← citeshttps://doi.org/10.1007/978-3-662-48350-3_52openalex-snapshot
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search
inferred← citeshttps://doi.org/10.1007/bf01415937openalex-snapshot
Implementing Goldberg's max-flow-algorithm ? A computational investigation
inferred← citeshttps://doi.org/10.1007/bf01580869openalex-snapshot
A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
inferred← citeshttps://doi.org/10.1007/bf01582580openalex-snapshot
Relaxation-based algorithms for minimax optimization problems with resource allocation applications
inferred← citeshttps://doi.org/10.1007/bf01594940openalex-snapshot
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1007/bf01680371openalex-snapshot
On balanced edge connectivity and applications to some bottleneck augmentation problems in networks
inferred← citeshttps://doi.org/10.1007/bf02192042openalex-snapshot
An auction algorithm for the max-flow problem
inferred← citeshttps://doi.org/10.1007/bf02564832openalex-snapshot
An algorithmic study of the Maximum Flow problem: A comparative statistical analysis
inferred← citeshttps://doi.org/10.1007/bfb0049391openalex-snapshot
Optimization algorithms for large networks
inferred← citeshttps://doi.org/10.1007/pl00009180openalex-snapshot
On Implementing the Push—Relabel Method for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1007/s00200-007-0039-8openalex-snapshot
Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
inferred← citeshttps://doi.org/10.1007/s00453-015-9998-5openalex-snapshot
Maximum Likelihood Analysis of the Ford–Fulkerson Method on Special Graphs
inferred← citeshttps://doi.org/10.1007/s10878-008-9159-8openalex-snapshot
Capacity inverse minimum cost flow problem
inferred← citeshttps://doi.org/10.1007/s11590-007-0055-4openalex-snapshot
An exact approach for the maximum concurrent k-splittable flow problem
inferred← citeshttps://doi.org/10.1007/s11590-009-0147-4openalex-snapshot
A fast heuristic algorithm for the maximum concurrent k-splittable flow problem
inferred← citeshttps://doi.org/10.1016/0377-2217(90)90074-lopenalex-snapshot
ORSEP (operations research software exchange program)
inferred← citeshttps://doi.org/10.1016/0377-2217(90)90136-yopenalex-snapshot
ORSEP (Operations research software exchange program)
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90060-9openalex-snapshot
The maximum flow problem: A max-preflow approach
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00035-bopenalex-snapshot
Multiperiod allocation of substitutable resources
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00137-9openalex-snapshot
An implementation of linear and nonlinear multicommodity network flows
inferred← citeshttps://doi.org/10.1016/j.artint.2010.02.001openalex-snapshot
Soft arc consistency revisited
inferred← citeshttps://doi.org/10.1016/j.cor.2004.03.012openalex-snapshot
Experimental evaluation of solution approaches for the K-route maximum flow problem
inferred← citeshttps://doi.org/10.1016/j.cor.2006.12.023openalex-snapshot
Efficient preflow push algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2012.02.003openalex-snapshot
A computational study of the capacity scaling algorithm for the maximum flow problem
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105558openalex-snapshot
An iterative security game for computing robust and adaptive network flows
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.027openalex-snapshot
Scheduling arc maintenance jobs in a network to maximize total flow over time
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.07.056openalex-snapshot
Minimizing the maximum flow loss in the network maintenance scheduling problem with flexible arc outages
inferred← citeshttps://doi.org/10.1016/j.ins.2018.12.009openalex-snapshot
Relational granulation method based on Quotient Space Theory for maximum flow problem
inferred← citeshttps://doi.org/10.1016/j.jocs.2022.101725openalex-snapshot
The capacity constraint physarum solver
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.1016/s0166-218x(00)00301-2openalex-snapshot
Efficient algorithms and codes for k-cardinality assignment problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00187-0openalex-snapshot
A polyhedral approach to an integer multicommodity flow problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(03)00171-0openalex-snapshot
A generalization of the scaling max-flow algorithm
inferred← citeshttps://doi.org/10.1016/s0305-0548(99)00102-1openalex-snapshot
On the first-order estimation of multipliers from Kuhn–Tucker systems
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00269-xopenalex-snapshot
Computational investigations of maximum flow algorithms
inferred← citeshttps://doi.org/10.1051/jnwpu/20183650955openalex-snapshot
Engineering Bi-Connected Component Overlay for Maximum-Flow Parallel Acceleration in Large Sparse Graph
inferred← citeshttps://doi.org/10.1109/70.265921openalex-snapshot
Optimal robust path planning in general environments
inferred← citeshttps://doi.org/10.1109/cec.2015.7257146openalex-snapshot
Hard test generation for augmenting path maximum flow algorithms using genetic algorithms: Revisited
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00037openalex-snapshot
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
inferred← citeshttps://doi.org/10.1109/grc.2012.6468649openalex-snapshot
Contracting community for computing maximum flow
inferred← citeshttps://doi.org/10.1109/icpads.2009.135openalex-snapshot
ERN: Emergence Rescue Navigation with Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1111/tgis.12271openalex-snapshot
A new dynamic network flow algorithm using base state amendment model for emergency response
inferred← citeshttps://doi.org/10.1137/1.9781611977912.140openalex-snapshot
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
inferred← citeshttps://doi.org/10.1142/s0217595921500275openalex-snapshot
A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
inferred← citeshttps://doi.org/10.1145/1064546.1180614openalex-snapshot
Implementing approximation algorithms for the single-source unsplittable flow problem
inferred← citeshttps://doi.org/10.1145/140901.140919openalex-snapshot
On the parallel implementation of Goldberg's maximum flow algorithm
inferred← citeshttps://doi.org/10.1145/2350190.2350198openalex-snapshot
Contraction network for solving maximum flow problem
inferred← citeshttps://doi.org/10.1145/2739482.2768487openalex-snapshot
Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm
inferred← citeshttps://doi.org/10.1145/3067695.3082507openalex-snapshot
Evaluation of heavy-tailed mutation operator on maximum flow test generation problem
inferred← citeshttps://doi.org/10.1145/3381449openalex-snapshot
JGraphT—A Java Library for Graph Data Structures and Algorithms
inferred← citeshttps://doi.org/10.1145/3728631openalex-snapshot
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
inferred← citeshttps://doi.org/10.1287/ijoc.11.4.370openalex-snapshot
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
inferred← citeshttps://doi.org/10.1287/opre.1080.0572openalex-snapshot
A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1287/opre.41.5.959openalex-snapshot
Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
inferred← citeshttps://doi.org/10.1287/opre.51.6.981.24912openalex-snapshot
Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
inferred← citeshttps://doi.org/10.1590/s0101-74382008000200005openalex-snapshot
Fortran subroutines for network flow optimization using an interior point algorithm
inferred← citeshttps://doi.org/10.2516/ogst:2000041openalex-snapshot
Optimisation du réseau algérien de transport de brut et de condensat
inferred← citeshttps://doi.org/10.3390/ijgi9090518openalex-snapshot
Optimized Spatiotemporal Data Scheduling Based on Maximum Flow for Multilevel Visualization Tasks
inferred← citeshttps://doi.org/10.3934/jimo.2016.12.117openalex-snapshot
A compaction scheme and generator for distribution networks
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93306openalex-snapshot
A framework for efficient execution of matrix computations
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93820openalex-snapshot
Mètodes eficients per a la resolució de problemes de fluxos multiarticle
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.