A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
From MaRDI portal
Publication:3260928
DOI10.4153/CJM-1957-024-0zbMath0088.12907OpenAlexW2044437461MaRDI QIDQ3260928
D. R. Fulkerson, L. R. Ford, Jr.
Publication date: 1957
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1957-024-0
Related Items
Improved filtering for the bin-packing with cardinality constraint, Solving matching problems with linear programming, A decomposition algorithm for multi-terminal network flows, Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow, Single-commodity robust network design problem: complexity, instances and heuristic solutions, The optimal tenement allocation for reducing traffic burden, Optimal transportation and the falsifiability of incompletely specified economic models, Network interdiction via a critical disruption path: branch-and-price algorithms, Unnamed Item, Maximum-Minimum Sätze über Graphen, Optimal flows in networks with multiple sources and sinks, Computing with sparse matrices, Matrices of zeros and ones, Maximum flow in a network with fuzzy arc capacities, Dyadic programs and subdual methods, The translation square map and approximate congruence, The computational complexity of optimal blocking of vertices in the digraph, A new?old algorithm for minimum-cut and maximum-flow in closure graphs, Integer programming models for mid-term production planning for high-tech low-volume supply chains, A primal simplex variant for the maximum-flow problem, A new Karzanov-type \(O(n^ 3)\) max-flow algorithm, Matching theory -- a sampler: From Dénes König to the present, Über reguläre Kettengruppen, Network interdiction to minimize the maximum probability of evasion with synergy between applied resources, Unnamed Item, Engpässe, Staustellen und glatte homogene Ströme in Netzen, \((F, I)\)-security in graphs, On the Inversion of Sparse Matrices, On optimal operation of communication nets, A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time, Transportation networks: Old and new, Disjoint Spread Systems and Fault Location, The sensitivity of a traffic network, The effectiveness of finite improvement algorithms for finding global optima, Bestimmung eines maximalen Matching in beliebigen Graphen, On a simple deadlock recovery problem, An approximation algorithm for the facility location problem with lexicographic minimax objective, Financial systems: A few theoretical and algebraic considerations for their modeling, On optimal matchings, Finding disjoint paths in networks with star shared risk link groups, On the \(l\)-connectivity of a digraph
