Maximal Flow Through a Network

DOI10.4153/CJM-1956-045-5zbMath0073.40203WikidataQ55880658 ScholiaQ55880658MaRDI QIDQ3237973

D. R. Fulkerson, L. R. Ford, Jr.

Publication date: 1956

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Topology

Related Items

Unnamed Item, Limsup deviations on trees, GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY, Cores and related solution concepts for multi-choice games, Shortest-Path-Finder Algorithm in a Two-Dimensional Array of Nonlinear Electronic Circuits, Optimization in telecommunication networks, APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS, The connectivity function of a graph, Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen, An Algorithm for Vertex-pair Connectivity, Optimal interdiction of a supply network, Complexity and compilability of diagnosis and recovery of graph-based systems, Über reguläre Kettengruppen, A fuzzy max-flow min-cut theorem., A cycle augmentation algorithm for minimum cost multicommodity flows on a ring, Time-varying universal maximum flow problems, A strongly polynomial time algorithm for a constrained submodular optimization problem, Systems of representatives, A note on two problems in connexion with graphs, A polynomial-time simplex method for the maximum \(k\)-flow problem, Selected topics on assignment problems, Local ratio with negative weights., The extremal length of a network, Investments in stochastic maximum flow networks, Ancestor tree for arbitrary multi-terminal cut functions, Short proofs on multicommodity flows and cuts, Maximum concurrent flows and minimum cuts, Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning, Matching theory -- a sampler: From Dénes König to the present, Ein kombinatorischer Beweis des Satzes von R. L. Ford und D. R. Fulkerson, On the connectivity of clusters, On partitions of a partially ordered set, Computational investigations of maximum flow algorithms, Plant location with minimum inventory, The line index and minimum cut of weighted graphs, Flow in planar graphs with vertex capacities, On the \(l\)-connectivity of a digraph, Dynamic programming and graph optimization problems, Two-edge connected spanning subgraphs and polyhedra, Optimally balancing assembly lines with different workstations, An analytic symmetrization of max flow-min cut, On perfectly two-edge connected graphs, Dynamic graph models, A fast algorithm for the minimax flow problem with 0/1 weights, A \(T_X\)-approach to some results on cuts and metrics, Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time, Fuzzy optimal flow on imprecise structures, Optimal wavelength-routed multicasting, An algorithmic study of the maximum flow problem: A comparative statistical analysis, A primal-dual approximation algorithm for the survivable network design problem in hypergraphs, A dual description of the class of games with a population monotonic allocation scheme, A generalization of the scaling max-flow algorithm, Circuit duality for recurrent Markov processes, A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts, An auction algorithm for the max-flow problem, The general counterfeit coin problem, Multiterminal flows and cuts, The project scheduling polyhedron: Dimension, facets and lifting theorems, A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, On optimal operation of communication nets, On the optimum synthesis of statistical communication nets - pseudo parametric techniques, Optimization of communication nets with switching, Analysis and design of communication networks with memory, The sensitivity of a traffic network, Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs, A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs, IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson, Maximum-Minimum Sätze über Graphen, On the strength of connectedness of a random graph, Sensitivity analysis of 0-1 multiterminal network flows, The optimal partitioning of networks, Minimum cuts and related problems, A generalization of max flow—min cut, Engpässe, Staustellen und glatte homogene Ströme in Netzen, A generalized dynamic flows problem, The effectiveness of finite improvement algorithms for finding global optima