scientific article; zbMATH DE number 3225808
From MaRDI portal
zbMath0139.13701MaRDI QIDQ5514188
L. R. Ford, Jr., D. R. Fulkerson
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)
Related Items
Maximal dynamic polymatroid flows and applications, The structure matrix of (0,1)-matrices: Its rank, trace, and eigenvalues. An application to econometric models, Combinatorial approaches to multiflow problems, On k-optimum dipath partitions and partial k-colourings of acyclic digraphs, On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem, Edge exchanges in the degree-constrained minimum spanning tree problem, Transitive closure and related semiring properties via eliminants, On the eigenvalues of the structure matrix of matrices of zeros and ones, An out-of-kilter method for submodular flows, Primal-dual algorithms for the assignment problem, Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations, An analog of the flexible polyhedron method for scheduling problems, Recognizing max-flow min-cut path matrices, Optimal representations of partially ordered sets and a limit Sperner theorem, On equivalence of two optimization methods for fuzzy discrete programming problems, An interactive system for constructing timetables on a PC, The k most vital arcs in the shortest path problem, An application of submodular flows, Polyhedra related to undirected multicommodity flows, Majorization, doubly stochastic matrices, and comparison of eigenvalues, A new integer programming formulation for the permutation flowshop problem, On the relation of max-flow to min-cut for generalized networks, The planar multiterminal cut problem, Systems of distinct representatives for k families of sets, The max-flow problem with parametric capacities, On Ryser's maximum term rank formula, Matchings in random regular bipartite digraphs, Structural aspects of controllability and observability. II: Digraph decomposition, The diagonal hypergraph of a matrix (bipartite graph), Total unimodularity and combinatorial theorems, Levelling terrain trees: A transshipment problem, Related necessary conditions for completing partial latin squares, Matrices of zeros and ones with fixed row and column sum vectors, An \(O(EV\log^2V)\) algorithm for the maximal flow problem, An extended abstract of an indepth algorithmic and computational study for maximum flow problems, Subgraphs and their degree sequences of a digraph, Substitutes and complements in network flow problems, On Haber's minimum term rank formula, On chains and Sperner k-families in ranked posets. II, A survey of scheduling methods for multiprocessor systems, On the theoretical efficiency of various network flow algorithms, Matrices of 0's and 1's with total support, When m vertices in a k-connected graph cannot be walked round along a simple cycle, Matroids and multicommodity flows, The complexity of testing whether a graph is a superconcentrator, Chromatic optimisation: Limitations, objectives, uses, references, Optimal cocircuits in regular matroids and applications, Triangular (0,1)-matrices with prescribed row and column sums, Konstruktion aller n-fach kantenzusammenhaengenden Digraphen, The global theory of paths in networks. I: Definitions, examples and limits, An algorithm for finding optimum path in networks, A note on the performance of limited entry queuing systems, The symmetric traveling salesman problem and edge exchanges in minimal 1- trees, A solution of the Sperner-Erdős problem, Approximation algorithms for hitting objects with straight lines, On the use of augmenting chains in chain packings, The principal lattice of partitions of a submodular function, Processor-efficient implementation of a maximum flow algorithm, A matching game, On a general network location--production--allocation problem, Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource, Infinite matching theory, Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning, The notion and basic properties of \(M\)-transversals, On a theorem of Mader, A new Karzanov-type \(O(n^ 3)\) max-flow algorithm, Ranking methods based on valued preference relations. A characterization of the net flow method, Matching theory -- a sampler: From Dénes König to the present, Integral matrices with given row and column sums, Optimal multiple interval assignments in frequency assignment and traffic phasing, Generalization of a theorem on the parametric maximum flow problem, The morphology of partially ordered sets, A good algorithm for edge-disjoint branching, Application of optimization methods to the hematological support of patients with disseminated malignancies, Graphs with degrees from prescribed intervals, Some properties of deadlock detection and recovery in readers and writers problems, Travelling time on dense networks, A note on degree-constrained star subgraphs of bipartite graphs, Convex polyhedra of doubly stochastic matrices. IV, Data analysis implications of some concepts related to the cuts of a graph, Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function, A network solution to a general vehicle scheduling problem, On the connectivity of clusters, On the truncated assignment polytope, The DT-polynomial approach to discrete time-varying network flow problems, A geometrical interpretation of the Hungarian method, A two-commodity cut theorem, An \(O(IVI^3)\) algorithm for finding maximum flows in networks, On k-minimally n-edge-connected graphs, On the existence of matrices with constrained elements, rows and columns, Analytic proofs of a network feasibility theorem and a theorem of Fulkerson, Edge-disjoint branching in directed multigraphs, A critical path generalization of the additive factor method: Analysis of a stroop task, Two mixed integer programming formulations arising in manufacturing management, A min-max resource allocation problem with substitutions, Fuzzy sharing problem, A graph colouring model for assigning a heterogeneous workforce to a given schedule, A note on finding minimum cuts in directed planar networks by parallel computations, Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions, Invariant sets of arcs in network flow problems, Dynamic programming and graph optimization problems, The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence, Finding a complete matching with the maximum product on weighted bipartite graphs, Resource allocation via dynamic programming in activity networks, PERT and crashing revisited: Mathematical generalizations, A heuristic improvement of the Bellman-Ford algorithm, Improving time bounds on maximum generalised flow computations by contracting the network, Integer partitions and the Sperner property, Maximum number of disjoint paths connecting specified terminals in a graph, Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes, Multi-terminal multipath flows: synthesis, Maximizing the value of a space mission, A network flow algorithm for just-in-time project scheduling, Multicommodity flows over time: Efficient algorithms and complexity, Investigating the relevance of graph cut parameter on interactive and automatic cell segmentation, Applications of cut polyhedra. II, On continuous network flows, Analysis of linear structured systems using a primal-dual algorithm, Flows over edge-disjoint mixed multipaths and applications, MC-based algorithm for a telecommunication network under node and budget constraints, On \(k\)-strong and \(k\)-cyclic digraphs, Max-min fairness in multi-commodity flows, An analytic symmetrization of max flow-min cut, Minimizing a linear multiplicative-type function under network flow constraints, Tabu search and iterated local search for the cyclic bottleneck assignment problem, Dynamic network flows for generalized Kirchhoff law, Multimodal transport network systems interface, interaction coordination: A specification for control systems integration, On a dynamic auction mechanism for a bilateral assignment problem, Generalizing the all-pairs min cut problem, Dynamic graph models, On the existence of sequences and matrices with prescribed partial sums of elements, Methods of the convex cone theory in the feasibility problem of multicommodity flow, Optimal channel allocation for several types of cellular radio networks, Cardinality-restricted chains and antichains in partially ordered sets, An approach for the network flow problem with multiple objectives, Infinite networks: Minimal cost flows, An integer fuzzy transportation problem, Interdicting the activities of a linear program -- a parametric analysis, An optimal capacity assignment for the robust design problem in capacitated flow networks, Triangulating multitolerance graphs, Temporal flows in temporal networks, Random \(a\)-adic groups and random net fractals, Two-commodity reliability evaluation for a stochastic-flow network with node failure, Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems, Overall-terminal reliability of a stochastic capacitated-flow network., On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint, Berge's conjecture on directed path partitions -- a survey, Decisions rules and flow networks., Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case., Induced matchings in intersection graphs., Heuristic algorithm for finding the maximum independent set, A survey on the continuous nonlinear resource allocation problem, Partition-based logical reasoning for first-order and propositional theories, An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts, Online linear optimization and adaptive routing, Computation and efficiency of potential function minimizers of combinatorial congestion games, Optimization problems of transportation in communication networks with variable capacities, Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope, Efficient preflow push algorithms, Shortest path algorithms for functional environments, Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies, Performance evaluation for a transportation system in stochastic case, New linearizations of quadratic assignment problems, Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming, A factorization theorem for a certain class of graphs, On combinatorial structures of line drawings of polyhedra, An algorithm to evaluate the system reliability for multicommodity case under cost constraint, New computational results for the discrete time/cost trade-off problem with time-switch constraints, Crop succession requirements in agricultural production planning, A particular timetable problem: Terminal scheduling, Deterministic network interdiction, Stochastic comparisons and couplings for interacting particle systems, Parametric min-cuts analysis in a network., Extensions of coloring models for scheduling purposes, Characterizing multiterminal flow networks and computing flows in networks of small treewidth, On the use of the complexity index as a measure of complexity in activity networks, Locomotive assignment with heterogeneous consists at CN North America, A decomposition of the matroids with the max-flow min-cut property, Fast pattern matching in indexed texts, Maximum balanced flow in a network, Minimization algorithms for sequential transducers, An improved approximation algorithm of MULTIWAY CUT., A principle of symmetry in networks, Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number, A characterization of minimizable metrics in the multifacility location problem, On one maximum multiflow problem and related metrics, Sufficient regularity conditions for common transversals, A GRASP heuristic for the mixed Chinese postman problem, Maximin problem of communication network synthesis, On the maximum capacity augmentation algorithm for the maximum flow problem, A tool for network modeling, Solving a system of difference constraints with variables restricted to a finite set, The GST load balancing algorithm for parallel and distributed systems, Logical analysis of binary data with missing bits, On the mixed Chinese postman problem, Graph-theoretic approach to symbolic analysis of linear descriptor systems, Convex generalized flows, Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values, A variational inequality formulation of the dynamic traffic assignment problem, Degree sequences and majorization, Dynamic graph models and their properties, A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs, Maximum weight independent sets and cliques in intersection graphs of filaments, Flows in dynamic networks with aggregate arc capacities, Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems, A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs, Assignment problems: a golden anniversary survey, Decomposition's Dantzig-Wolfe applied to fuzzy multicommodity flow problems, An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks, New reformulations of distributionally robust shortest path problem, Complexity and approximability of \(k\)-splittable flows, A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity, Approximating earliest arrival flows with flow-dependent transit times, Cycle-based reducibility of multi-index transport-type systems of linear inequalities, Traffic assignment in communication satellites, An improved Dijkstra's shortest path algorithm for sparse network, Two fast algorithms for all-pairs shortest paths, Integer matrices with constraints on leading partial row and column sums, System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight, Cones of closed alternating walks and trails, System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts, On a class of mixed-integer sets with a single integer variable, Shortest path and maximum flow problems in networks with additive losses and gains, Scheduling arc maintenance jobs in a network to maximize total flow over time, A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks, Novel matrix forms of rough set flow graphs with applications to data integration, Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget, Minimal-cost network flow problems with variable lower bounds on arc flows, Finding the shortest paths by node combination, Aggregation of monotone reciprocal relations with application to group decision making, Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS, A new \(O(n^ 2)\) shortest chain algorithm, On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph, Generalized Robinson-Schensted-Knuth correspondence, Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems, New methods for multi-commodity flows, An introduction to dynamic generative networks: minimum cost flow, Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem, Design of fault-tolerant on-board networks with variable switch sizes, Finding a subdivision of a digraph, Sensor location and classification for disturbance rejection by measurement feedback, Maximum probability shortest path problem, The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate, A genuinely polynomial primal simplex algorithm for the assignment problem, Submodular functions in graph theory, On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint, Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths, An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Reliability evaluation of multi-state systems under cost consideration, An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths, Most balanced minimum cuts, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, Survey of polynomial transformations between NP-complete problems, Multistate components assignment problem with optimal network reliability subject to assignment budget, A dynamic bounding algorithm for approximating multi-state two-terminal reliability, Spectral methods for graph clustering - a survey, Single source shortest paths in \(H\)-minor free graphs, On the expected value of stochastic linear programs and (dynamic) network flow problems, Two easy duality theorems for product partial orders, On certain convex matrix sets, Optimal resource assignment to maximize multistate network reliability for a computer network, Bipartite matching extendable graphs, A faster polynomial algorithm for the unbalanced Hitchcock transportation problem, Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width, Integer version of the multipath flow network synthesis problem, Multicommodity flows in certain planar directed networks, Railway scheduling by network optimization, On module assignment in two-processor distributed systems, The mixed postman problem, Metrics on spaces of finite trees, An introduction to timetabling, Rooted \(k\)-connections in digraphs, A polynomial algorithm for minimum quadratic cost flow problems, Models of central capacity and concurrency, On core stability, vital coalitions, and extendability, Cut generation for an integrated employee timetabling and production scheduling problem, Tight spans of distances and the dual fractionality of undirected multiflow problems, Two flow network simplification algorithms, Transmission facility planning in telecommunications networks: A heuristic approach, A network flow procedure for project crashing with penalty nodes, A solution method for the non-additive resource allocation problem in distributed system design, On a simple deadlock recovery problem, The network flows approach for matrices with given row and column sums, Optimal matchings in posets, Network models for vehicle and crew scheduling, Chromatic number of classes of matrices of zeros and ones, A new look at the optimal assignment problem, A strengthening of the Kuratowski planarity criterion for 3-connected graphs, Variation on a theorem of König, Real-valued flows in a network with fuzzy arc capacities, Decomposition by clique separators, Detection of structural inconsistency in systems of equations with degrees of freedom and its applications, The class of matrices of zeros, ones, and twos with prescribed row and column sums, A case of non-convergent dual changes in assignment problems, A new proof of a theorem of Harper on the Sperner-Erdős problem, Minimum deviation and balanced optimization: A unified approach, Representing inverses in pure network flow optimization, Sparsest cuts and bottlenecks in graphs, The maximum flow problem: A max-preflow approach, Algorithms for finding a rooted \((k,1)\)-edge-connected orientation, The structure matrix and a generalization of Ryser's maximum term rank formula, Optimal parallel construction of prescribed tournaments, Hypergraph Cuts with General Splitting Functions, On the foundations of linear and integer linear programming I, Difference graphs, Jump Number of Two-Directional Orthogonal Ray Graphs, Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem, GNet: a generalized network model and its applications in qualitative spatial reasoning, Determination of the candidate arc set for the asymmetric traveling salesman problem, A sum of disjoint products algorithm for reliability evaluation of flow networks, Time-varying universal maximum flow problems, Finite posets and Ferrers shapes, Sweep synchronization as a global propagation mechanism, Optimal collective dichotomous choice under partial order constraints, Perfect, ideal and balanced matrices, A hybrid methodology for learning belief networks: BENEDICT, Lower and upper bounds for the mixed capacitated arc routing problem, A comparison of two different formulations for arc routing problems on mixed graphs, Planar graphs, negative weight edges, shortest paths, and near linear time, On pedigree polytopes and Hamiltonian cycles, Study on the multicommodity reliability of a capacitated-flow network, Simultaneous well-balanced orientations of graphs, Heuristic shortest path algorithms for transportation applications: state of the art, A simple algorithm for reliability evaluation of a stochastic-flow network with node failure, A Stackelberg strategy for routing flow over time, On the relationship between the cut-tree and the fundamental cut-set of multi-terminal flow networks, Applications of Menger's graph theorem, Extremal configurations and decomposition theorems. I, A prediction theory for some nonlinear functional-differential equations. I: Learning of lists, A prediction theory for some nonlinear functional-differential equations. II: Learning of patterns, Systems of representatives, On the global limits and oscillations of a system of nonlinear differential equations describing a flow on a probabilistic network, On the optimum synthesis of statistical communication nets - pseudo parametric techniques, Flow variation in multiple min-cut calculations, The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix, Analysis and design of communication networks with memory, Estimation of terminal capacity in probabilistic communication nets, BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT, An \(n^ 2\) algorithm for determining the bridges of a graph, The sensitivity of a traffic network, Multidimensional scaling of measures of distance between partitions, On a bidirected relaxation for the MULTIWAY CUT problem, Logistics networks: a game theory application for solving the transshipment problem, Reduction from three-dimensional discrete tomography to multicommodity flow problem, Fast data transmission and maximal dynamic flow., An improved algorithm for decomposing arc flows into multipath flows, The multiple TSP with time windows: vehicle bounds based on precedence graphs
