A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

Cited In (43)

Network interdiction to minimize the maximum probability of evasion with synergy between applied resources
Title not available (Why is that?)
On optimal matchings
A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
A decomposition algorithm for multi-terminal network flows
Improved filtering for the bin-packing with cardinality constraint
On the Inversion of Sparse Matrices
Finding disjoint paths in networks with star shared risk link groups
Optimal transportation and the falsifiability of incompletely specified economic models
Integer programming models for mid-term production planning for high-tech low-volume supply chains
Engpässe, Staustellen und glatte homogene Ströme in Netzen
Über reguläre Kettengruppen
The optimal tenement allocation for reducing traffic burden
Single-commodity robust network design problem: complexity, instances and heuristic solutions
Computing with sparse matrices
The computational complexity of optimal blocking of vertices in the digraph
Optimal flows in networks with multiple sources and sinks
\((F, I)\)-security in graphs
Matching theory -- a sampler: From Dénes König to the present
The translation square map and approximate congruence
Network interdiction via a critical disruption path: branch-and-price algorithms
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
Maximum flow in a network with fuzzy arc capacities
On the \(l\)-connectivity of a digraph
Multistage production-distribution problem
A primal simplex variant for the maximum-flow problem
Bestimmung eines maximalen Matching in beliebigen Graphen
Matrices of zeros and ones
Unifying lower bounds for algebraic machines, semantically
An approximation algorithm for the facility location problem with lexicographic minimax objective
Transportation networks: Old and new
Title not available (Why is that?)
On a simple deadlock recovery problem
A new Karzanov-type \(O(n^ 3)\) max-flow algorithm
Maximum-Minimum Sätze über Graphen
Solving matching problems with linear programming
On optimal operation of communication nets
Financial systems: A few theoretical and algebraic considerations for their modeling
Disjoint spread systems and fault location
Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
The effectiveness of finite improvement algorithms for finding global optima
The sensitivity of a traffic network
Dyadic programs and subdual methods

This page was built for publication: A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3260928)