scientific article
From MaRDI portal
Publication:3292914
zbMath0106.34802MaRDI QIDQ3292914
D. R. Fulkerson, L. R. Ford, Jr.
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21)
Related Items
Minimax problem of suppressing a communication network, On reformulations for the one-warehouse multi-retailer problem, Maximum likelihood analysis of the Ford-Fulkerson method on special graphs, The discrete time/cost trade-off problem: Extensions and heuristic procedures, Approximation algorithms for solving the constrained arc routing problem in mixed graphs, Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs, Quick max-flow algorithm, Stochastic and dynamic shipper carrier network design problem, Network topology and locational market power, Two-phase branch-and-cut for the mixed capacitated general routing problem, Approximation algorithms for treewidth, Reliability-based economic model predictive control for generalised flow-based networks including actuators' health-aware capabilities, A simple algorithm to evaluate supply-chain reliability for brittle commodity logistics under production and delivery constraints, Double resource optimization for a robust computer network subject to a transmission budget, Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate, The value of information in stochastic maximum flow problems, Branch and bound for the cutwidth minimization problem, Solution approaches for the cutting stock problem with setup cost, Joint routing and rate allocation for multiple video streams in ad-hoc wireless networks, Mining preserving structures in a graph sequence, A model-based approach and analysis for multi-period networks, Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning, Multicriterial multi-index resource scheduling problems, Bidirectional resource networks: A new flow model, Braess's paradox for flows over time, Optimal placement of UV-based communications relay nodes, \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time, A product form solution to a system with multi-type jobs and multi-type servers, Alternating paths along axis-parallel segments, Asymmetric resource networks. III: A study of limit states, Approximation algorithms for multiprocessor scheduling under uncertainty, Static and dynamic source locations in undirected networks, Extensions to 2-factors in bipartite graphs, Global binary optimization on graphs for classification of high-dimensional data, Pattern matching with wildcards and length constraints using maximum network flow, Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs, Uncertain minimum cost flow problem, Weighted maximum-clique transversal sets of graphs, The inverse maximum dynamic flow problem, On flows in simple bidirected and skew-symmetric networks, Approximation algorithms for \(k\)-hurdle problems, On the complexity of bribery and manipulation in tournaments with uncertain information, Domain decomposition methods with graph cuts algorithms for total variation minimization, The maximum flow problem of uncertain network, Maximum flow in directed planar graphs with vertex capacities, Continuous and discrete flows over time, Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem, Random walks in random Dirichlet environment are transient in dimension \(d \geq 3\), Phased graphs and graph energies, A survey of dynamic network flows, On solving continuous-time dynamic network flows, Nash equilibria and the price of anarchy for flows over time, Non-coexistence of infinite clusters in two-dimensional dependent site percolation, Control of limit states in absorbing resource networks, Weighted graphs with fixed vertex degrees and network flows, Updating network flows given multiple, heterogeneous arc attribute changes, Maximum \(k\)-splittable \(s, t\)-flows, Maximal flow in branching trees and binary search trees, On the complexity of time-dependent shortest paths, A knowledge-based analysis of global function computation, A note on edge-based graph partitioning and its linear algebraic structure, Stochastic computer network under accuracy rate constraint from QoS viewpoint, Processing time-dependent shortest path queries without pre-computed speed information on road networks, About the minimum mean cycle-canceling algorithm, Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros, The problem of maximum flow with minimum attainable cost in a network, Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network, Linguistic performance evaluation for an ERP system with link failures, Design of an efficient load balancing algorithm using the symmetric balanced incomplete block design, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, An improved branch and bound algorithm for minimum concave cost network flow problems, Lattice flows in networks, Polynomial dual network simplex algorithms, 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem, Minimum flow problem on network flows with time-varying bounds, What the transportation problem did for me, Ideal clutters, Structural and algorithmic properties for parametric minimum cuts, Minimizing the density of terminal assignments in layout design, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), A measure-theoretical max-flow-min-cut problem, On the most imbalanced orientation of a graph, On the planar integer two-flow problem, Half-trek criterion for generic identifiability of linear structural equation models, Exact solution approaches for the multi-period degree constrained minimum spanning tree problem, Maximizing network throughput under stochastic user equilibrium with elastic demand, Multicommodity flows in tree-like networks, Optimal routing of data flows in wireless sensor networks, The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths, Bidimensional allocation of seats via zero-one matrices with given line sums, A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time, \(k\)-independent percolation on trees, Asymmetrical resource networks. I. Stabilization processes for low resources, Finding feasible vectors of Edmonds-Giles polyhedra, A maximum flow problem with intermediate node requirements, Failure of averaging on multiply-connected domains, An infeasible (exterior point) simplex algorithm for assignment problems, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, Locating stops along bus or railway lines -- a bicriteria problem, Complete bound consistency for the global cardinality constraint, A strongly polynomial minimum cost circulation algorithm, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Minimum cost multiflows in undirected networks, Comparison of formulations and a heuristic for packing Steiner trees in a graph, On the \(k\)-cut subgraph polytope, Algorithms constructing a representive vector criterion for a binary preference relation, Maximum of k-th maximal spanning trees of a weighted graph, Menger's theorem for countable graphs, Operations research games: A survey. (With comments and rejoinder), A new approach for crew pairing problems by column generation with an application to air transportation, Inverse matroid intersection problem, Minimum cost forest games, Arranging apples in an array, Dual coordinate step methods for linear network flow problems, Lower bounds on two-terminal network reliability, Generalized polymatroids and submodular flows, Multiflows and disjoint paths of minimum total cost, Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions, Efficient parallel algorithms for the minimum cost flow problem, Consistency, redundancy, and implied equalities in linear systems, Minimum cut problem using bases of extended polymatroids, A short proof of the two-commodity flow theorem, Activity nets: A guided tour through some recent developments, On chain and antichain families of a partially ordered set, An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem, Discrete extremal problems, The global theory of flows in networks, Number of admissible linear orderings of a partially ordered set as a function of its incomparability graph, A problem in a telephone system, Decomposition of group flows in regular matroids, How to make a digraph strongly connected, Routing through a network with maximum reliability, Nonlinear one-parametric minimal cost network flow problems, The ellipsoid method and its consequences in combinatorial optimization, Cost-effective allocations of bounded and binary resources in polynomial time, Efficiency and time-cost-tradeoffs in transportation problems, Use of dynamic trees in a network simplex algorithm for the maximum flow problem, Investments in stochastic maximum flow networks, Ancestor tree for arbitrary multi-terminal cut functions, A mixed version of Menger's theorem, Computational results of an interior point algorithm for large scale linear programming, Tiling polygons with parallelograms, A fast algorithm for the generalized parametric minimum cut problem and applications, On the computational behavior of a polynomial-time network flow algorithm, Automatic generation of path conditions for concurrent timed systems, On the convergence of the affine-scaling algorithm, Coflow polyhedra, A pseudo-Boolean consensus approach to nonlinear 0-1 optimization, Inequalities for the number of linear extensions, Auction algorithms for network flow problems: A tutorial introduction, Complexity analysis for maximum flow problems with arc reversals, Greene-Kleitman's theorem for infinite posets, Extending partial tournaments, Pairs of sequences with a unique realization by bipartite graphs, A problem reduction based approach to discrete optimization algorithm design, Blocking pairs of polyhedra arising from network flows, Some applications of graph theory to clustering, Über n-fach zusammenhängende Eckenmengen in Graphen, Acyclic orientations of a graph and the chromatic and independence numbers, On the bottleneck assignment problem, A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy, Simple and improved parameterized algorithms for multiterminal cuts, Vertex colorings without isolates, Maximum flow problem on dynamic generative network flows with time-varying bounds, A network flow model for biclustering via optimal re-ordering of data matrices, Maximum flows and minimum cuts in the plane, An elementary proof of Moon's theorem on generalized tournaments, Links between image segmentation based on optimum-path forest and minimum cut in graph, On Markov chains generated by Markovian controlled Markov systems. I: Ergodic properties, Convex polytopes of permutation invariant doubly stochastic matrices, The matroids with the max-flow min-cut property, Rake linking for suburban train services, Dynamic graphs, Numerical investigations on the maximal flow algorithm of Karzanov, Extracting maximal information about sets of minimum cuts, The capacity of monotonic functions, Approximate labelled subtree homeomorphism, Formal derivation of graph algorithmic programs using partition-and-recur, Measuring intransitivity, Resistance bounds for first-passage percolation and maximum flow, Inverse problems of submodular functions on digraphs, New algorithms for convex cost tension problem with application to computer vision, Minimizing symmetric submodular functions, Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case, Pre-processing techniques for resource allocation in the heterogeneous case, On the total\(_k\)-diameter of connection networks, Inverse problem of minimum cuts, Upsets in round robin tournaments, The stochastic bottleneck linear programming problem, Finding minimum generators of path systems, Efficient continuous-time dynamic network flow algorithms, On dependent randomized rounding algorithms, A recognition problem in converting linear programming to network flow models, Analytische Verfahren zur Dimensionierung von Fahrzeugsystemen, Estimates of general Mayer graphs. II. Long range behaviour of graphs with two root points occuring in the theory of ionized systems, Parallel primal-dual methods for the minimum cost flow problem, Tight bounds on the number of minimum-mean cycle cancellations and related results, A faster parametric minimum-cut algorithm, Algorithms and complexity analysis for some flow problems, Examples of max-flow and min-cut problems with duality gaps in continuous networks, Generalized zeon algebras: theory and application to multi-constrained path problems, Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\), Multi-criteria assignment problem with incompatibility and capacity constraints, Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation, Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration, An improved parameterized algorithm for the minimum node multiway cut problem, Matheuristic algorithms for the parallel drone scheduling traveling salesman problem, Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, Statistical distributions connected to motion of substance in a channel of a network, Classes of linear programs solvable by coordinate-wise minimization, Intersecting and dense restrictions of clutters in polynomial time, Uniform resource networks. I: Complete graphs, Continuous dynamic contraflow approach for evacuation planning, Random fractals and tree-indexed Markov chains, Efficient continuous contraflow algorithms for evacuation planning problems, Polynomially determining spanning connectivity of locally connected line graphs, Atomic routing game with capacity constraints, A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs, Minimum cost noncrossing flow problem on layered networks, On some graph classes related to perfect graphs: a survey, Netscan: a procedure for generating reaction networks by size, An improved algorithm for two stage time minimization assignment problem, Equilibria in routing games with edge priorities, Finding optimal non-datapath caching strategies via network flow, Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory, Vyacheslav Tanaev: contributions to scheduling and related areas, Solving RCPSP/max by lazy clause generation, Analysis of cluster damages in network systems, 4-connected triangulations on few lines, Scheduling two projects with controllable processing times in a single-machine environment, An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem, A spatially continuous max-flow and min-cut framework for binary labeling problems, Network flow with intermediate storage: models and algorithms, Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems, Multiindex resource distributions for hierarchical systems, Shortest path network problems with stochastic arc weights, Balanced flows for transshipment problems, Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations, Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap, Traffic engineering of management flows by link augmentations on confluent trees, Algorithms for an integer multicommodity network flow problem with node reliability considerations, Abstract flows over time: a first step towards solving dynamic packing problems, A note on the parametric maximum flow problem and some related reoptimization issues, Flows over time in time-varying networks: optimality conditions and strong duality, A fast algorithm for cactus representations of minimum cuts, Algorithms for core stability, core largeness, exactness, and extendability of flow games, A fast algorithm for the path 2-packing problem, Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems, Unreliability evaluation for a limited-flow network with failed nodes subject to the budget constraint, Meet and merge: approximation algorithms for confluent flows, The design and analysis of an efficient load balancing algorithm employing the symmetric balanced incomplete block design, An Approximate Algorithm for the Robust Design in a Stochastic-Flow Network, Interactive segmentation based on component-trees, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Capacitated automata and systems, A surface reconstruction method using global graph cut optimization, Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks, Evaluation of system reliability for a stochastic delivery-flow distribution network with inventory, An approach to the analysis of possible structural damages in multicommodity network systems, Assessment of system reliability for a stochastic-flow distribution network with the spoilage property, Density and cost in nonlinear control, A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem, A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks, Partial contraflow with path reversals for evacuation planning, Resource allocation among attractor vertices in asymmetric regular resource networks, A survey on models and algorithms for discrete evacuation planning network problems, Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search, A permutation-and-backtrack approach for reliability evaluation in multistate information networks, Impact of compressor failures on gas transmission network capability, A theorem on common transversals, Comments on certain combinatorial theorems of Ford and Fulkerson, Flows on two-dimensional networks, Optimum flows in general communication networks, Optimal \(K\)-node disruption on a node-capacitated network, $$P\mathop{ =}\limits^{?}NP$$, Universal method of searching for equilibria and stochastic equilibria in transportation networks, A weighted graph embedding technique and its application to automatic circuit layout, Anti-blocking polyhedra, Flüsse in antisymmetrischen Netzwerken. (Flows in anti-symmetric networks.), Mehrdimensionale Zuordnungsprobleme und Netzwerkflüsse mit vorgegebenen Wertemengen. (Multi-dimensional assignment problems and network flows with given sets of values.), Marked directed graphs, Distributed Evacuation in Graphs with Multiple Exits, Use of the simplex method in nonlinear programming for duct layout design, Fuel and energy system control at large-scale damages. IV: A priori estimates of structural and functional vulnerability, Stability of the Bipartite Matching Model, Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen, Kantendisjunkte Wege in Graphen, Der Out-of-Kilter-Algorithmus für antisymmetrische Netzwerke, Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks, Path problems in skew-symmetric graphs, A dynamic graph characterisation of the fixed part of the controllable subspace of a linear structured system, Paths to stable allocations, Discrete Newton methods for the evacuation problem, An iterative graph expansion approach for the scheduling and routing of airplanes, Some inverse optimization problems under the Hamming distance, A network approach modeling of multi-echelon spare-part inventory system with backorders and quantity discount, Structural analysis of sensor location for disturbance rejection by measurement feedback, Multiroute flows: cut-trees and realizability, Optimal double-resource assignment for a distributed multistate network, Efficient global minimization methods for image segmentation models with four regions, Matching-based capture strategies for 3D heterogeneous multiplayer reach-avoid differential games, Mixed Pfair/ERfair scheduling of asynchronous periodic tasks, Minimum \(k\) arborescences with bandwidth constraints, Efficient contraflow algorithms for quickest evacuation planning, Spanning tree of a multiple graph, Base polyhedra and the linking property, The mixed evacuation problem, Dynamic multicommodity contraflow problem with asymmetric transit times, Checking the admissibility of odd-vertex pairings is hard, An approximate max-flow min-cut relation for undirected multicommodity flow, with applications, Identifying restrictions of linear equations with applications to simultaneous equations and cointegration, On the motion of substance in a channel of a network and human migration, Improved bounds on the max-flow min-cut ratio for multicommodity flows, An efficient searching method for minimal path vectors in multi-state networks, Fuel and energy system control at large-scale damages. I: Network model and software implementation, DNA physical mapping and alternating Eulerian cycles in colored graphs, Complexity of trajectories in rectangular billiards, A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem, Nonlinear programming methods and network flows, A new two-stage heuristic for the recreational vehicle scheduling problem, On supply-function equilibria in radial transmission networks, An auction algorithm for the max-flow problem, Dynamic traffic assignment: Considerations on some deterministic modelling approaches, A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs, Proportionate progress: A notion of fairness in resource allocation, Shortest paths algorithms: Theory and experimental evaluation, Assessing the reliability of a multistate logistics network under the transportation cost constraint, Branch-and-price algorithm for fuzzy integer programming problems with block angular structure, A capacitated network flow optimization approach for short notice evacuation planning, The shared customer collaboration vehicle routing problem, Min-cost multiflows in node-capacitated undirected networks, On tight spans for directed distances, A spatial regularization approach for vector quantization, Optimal egress time calculation and path generation for large evacuation networks, Metric packing for \(K_ 3 + K_ 3\), Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm, Determining the optimal flows in zero-time dynamic networks, Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games, Random Dirichlet environment viewed from the particle in dimension \(d\geq 3\), Models and methods for solving the problem of network vulnerability, A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project, Convexification of generalized network flow problem, Minimum self-dual decompositions of positive dual-minor Boolean functions, Stochastic comparisons for general probabilistic cellular automata, 2-3 paths in a lattice graph: random walks, Deciding bisimilarity and similarity for probabilistic processes., Stable flows over time, Number representation of satisfiability, The complexity of routing with collision avoidance, Continuous time dynamic contraflow models and algorithms, Optimal double-resource assignment for the robust design problem in multistate computer networks, Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks, Blocking optimal structures, Regenerator location problem: polyhedral study and effective branch-and-cut algorithms, Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods, Multivariate complexity analysis of Swap Bribery, Vehicle routing under time-dependent travel times: the impact of congestion avoidance, Flow-firing processes, Random walks in Dirichlet environment: an overview. Dedicated to Dominique Bakry on the occasion of his 60th birthday, Solution methods for the vertex variant of the network system vulnerability analysis problem, Method of characteristic functions for classes of networks with fixed node degrees, Ant-based clustering for flow graph mining, Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, The diameters of network-flow polytopes satisfy the Hirsch conjecture, Decomposition theorems for linear programs, Independent sets and hitting sets of bicolored rectangular families, Fuel and energy system control at large-scale damages. II: Optimization problems, Flows on measurable spaces, An analogue of Hoffman's circulation conditions for max-balanced flows, Towards equitable distribution via proportional equity constraints, 3D reconstruction with depth prior using graph-cut, A computational study of several heuristics for the DRPP, Polyhedra for lot-sizing with Wagner-Whitin costs, Implementing an efficient minimum capacity cut algorithm, Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures, Fleet assignment and routing with schedule synchronization constraints, Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs, On circuit decomposition of planar Eulerian graphs, Reconstruction, optimization, and design of heterogeneous materials and media: basic principles, computational algorithms, and applications, Using the graph-cut method to segment the mineralization area in the gejiu region of Yunnan province, China, Generalized edge packings, Computing in combinatorial optimization, Unimodular Hausdorff and Minkowski dimensions, Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities, Social learning in nonatomic routing games, On the motion of substance in a channel and growth of random networks, Efficient algorithms for abstract flow with partial switching, An equivalency problem in discrete programming over ordered semigroups, Decreasing minimization on M-convex sets: algorithms and applications, Control strategies for transport networks under demand uncertainty, Heterogeneous multi-commodity network flows over time, Abstract network flow with intermediate storage for evacuation planning, Solving some lexicographic multi-objective combinatorial problems, On multiflow lexicographics, Timed network games, Reliability evaluation and big data analytics architecture for a stochastic flow network with time attribute, System reliability for a multi-state distribution network with multiple terminals under stocks, Reliability evaluation in terms of flow data mining for multistate networks, Algorithms for flows over time with scheduling costs, Single source unsplittable flows with arc-wise lower and upper bounds, Network design and dynamic routing under queueing demand, Flow in networks with random capacities, A time expanded matroid algorithm for finding optimal dynamic matroid intersections, Optimal monotone relabelling of partially non-monotone ordinal data, Semiantichains and Unichain Coverings in Direct Products of Partial Orders, File allocation in a distributed database, An algorithm for the maximum internally stable set in a weighted graph, Ein Verfahren zur Optimierung von Nachrichtenübertragungsnetzen mit Mehrwegeführung, Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm, On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, Smoothed Analysis of the Successive Shortest Path Algorithm, Identifiability of a simultaneous equations model of economy: a structural view, Optimal Embedding into Star Metrics, Discrete Driver Assistance, Affirmative action algorithms, The maximum flow problem in a network with special conditions of flow distribution, Scaling: A general framework, A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm, Linear-Time Approximation for Maximum Weight Matching, Reliability assessment of a stochastic node-failure network with multiple sinks under tolerable error rate, Miu Cost Tensions, On the Most Imbalanced Orientation of a Graph, Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm, Controllability and the theory of economic policy: a structural approach, A direct dual method for the mixed plant location problem with some side constraints, Minimum-cost flow algorithms: an experimental evaluation, The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks, Profile-Based Optimal Matchings in the Student/Project Allocation Problem, A particular timetable problem: terminal scheduling, The quickest flow problem, Algorithms for Multiterminal Cuts, Pickup and Delivery of Partial Loads with “Soft” Time Windows, The Mixed Evacuation Problem, The Maximum Energy-Constrained Dynamic Flow Problem, A Path Cover Technique for LCAs in Dags, Optimal flows in networks with multiple sources and sinks, Single-Sink Multicommodity Flow with Side Constraints, An Introduction to Network Flows over Time, Reliability assessment of a multistate freight network for perishable merchandise with multiple suppliers and buyers, Algorithms for Finding Optimal Flows in Dynamic Networks, Quasi-balanced matrices, Packing and covering with integral feasible flows in integral supply-demand networks, Discrete Approximations to Continuum Optimal Flow Problems, Break minimization, A Ford-Fulkerson type theorem concerning vector-valued flows in infinite networks, An improved version of the out-of-kilter method and a comparative study of computer codes, Vertex packings: Structural properties and algorithms, A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem, An algorithm for the determination of longest distances in a graph, Algorithms for flows with parametric capacities, Existence and Uniqueness of Equilibria for Flows over Time, Preemptive Scheduling, Linear Programming and Network Flows, Maximum Flows and Minimum Cuts in the Plane, A note on matrics with given diagonal entries, IFORS' Operational Research Hall of Fame Delbert Ray Fulkerson, A network simplex method, A good algorithm for lexicographically optimal flows in multi-terminal networks, On the subdifferential of a submodular function, An algorithm for finding the number of (0, 1, 2,…, l)-matrices with prefixed row sum and column sum vectors, Decomposing symmetric exchanges in matroid bases, An algebraic approach to assignment problems, On the width—length inequality, Cost operator algorithms for the transportation problem, On the integer-valued variables in the linear vertex packing problem, Some relationships between lagrangian and surrogate duality in integer programming, Maximizing the minimum source-sink path subject to a budget constraint, Primal transportation and transshipment algorithms, A note on the paper “characterization of all optimal solutions and parametric maximal flows in networks” of G. Ruhe (optimization 16 (1985) 1, 51-61), Graphic matroids and the multicommodity transportation problem, Stochastische Transportprobleme, Cones, graphs and optimal scalings of matrices, Random directed graph distributions and the triad census in social networks†, Effective algorithm for the weber problem with a rectangular metric, Program deparallelization using the method of successive penetration, Unnamed Item, Graph Cut Optimization for the Piecewise Constant Level Set Method Applied to Multiphase Image Segmentation, A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles, Some aspects on solving transportation problem, Traffic Networks and Flows over Time, Duality relationships between a class of graphs and linear programs, Fcfs infinite bipartite matching of servers and customers, Quantum computing and hidden variables, Multiterminal network flows and applications, Maximal flow through a domain, A Stochastic Flow Problem, Maximum-throughput dynamic network flows, Minimalist approach to the classification of symmetry protected topological phases, Decomposition algorithms for locating minimal cuts in a network, Lexicographic Orientation Algorithms, Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints, Automatic Graph-Based Local Edge Detection, Metrics and undirected cuts, Optimal Dynamic Multicommodity Flows in Networks, A unified framework for primal-dual methods in minimum cost network flow problems, Characterization of all optimal solutions and parametric maximal mows in networks, A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments, Parallel Algorithms for Network Routing Problems and Recurrences, On recursive computation of minimum spanning trees for special partial graphs, An economic equilibrium model on a multicommodity network, Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations, Probabilistic power domains, information systems, and locales, Homogenisation of dynamical optimal transport on periodic graphs, Conveyor operations in distribution centers: modeling and optimization, Greedoids from flames, Broadcasting in split graphs, An optimal pruned traversal tree-based fast minimum cut solver in dense graph, The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph, Minimum cost flow problem with conflicts, Lexicographically optimal earliest arrival flows, The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph, Large‐scale zone‐based evacuation planning—Part I: Models and algorithms, Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms, Maximum skew-symmetric flows, A note on the quickest minimum cost transshipment problem, A note on social learning in non-atomic routing games, Scalable timing-aware network design via Lagrangian decomposition, Adjacencies on random ordering polytopes and flow polytopes, A survey on exact algorithms for the maximum flow and minimum‐cost flow problems, Approximating maximum integral multiflows on bounded genus graphs, Concurrent flows and packet routing in Cayley graphs (Preliminary version), Multi-commodity flow problem on lossy network with partial lane reversals, Lower bounds for non-adaptive shortest path relaxation, Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach, Two commodity network flows and linear programming, A new derivation of Frisch's algorithm for calculating vertex-pair connectivity, An “out-of-kilter” algorithm for solving minimum cost potential problems, Unnamed Item, Ein Algorithmus für Teilnetzpläne, COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS, ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS, Intra-domain traffic engineering with shortest path routing protocols, Time-varying minimum cost flow problems, Intra-domain traffic engineering with shortest path routing protocols, A dual to Lyapunov's stability theorem, An efficient network flow code for finding all minimum cost \(s-t\) cutsets, New and simple algorithms for stable flow problems, Graph theory, On the shortest path problem with negative cost cycles, A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows, Dynamic flows with adaptive route choice, A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows, Accelerated Bend Minimization, NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3, Counting measures, monotone random set functions, Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen, Algorithms for Flows over Time with Scheduling Costs, Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds, Boolean analysis of incomplete examples, Recent developments in maximum flow algorithms, DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS, Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem, An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications, Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu search, On the capabilities of systolic systems, Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm, Computation of Dynamic Equilibria in Series-Parallel Networks, Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains, Imposing Contiguity Constraints in Political Districting Models, Unnamed Item, A complete characterization of the path layout construction problem for ATM networks with given hop count and load, On the Price of Anarchy for Flows over Time, Basis characterisation for linear multicommodity network programs, Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems, Graph Bisection with Pareto Optimization, Algorithms for the quickest time distribution of dynamic stochastic-flow networks, Some problems in discrete optimization, Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach, Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time, On implementing push-relabel method for the maximum flow problem, Unnamed Item, A Very General Theorem on Systems of Distinct Representatives, On the fixed cost flow problem†, An existence theorem for packing problems with implications for the computation of optimal machine schedules, Unnamed Item, Unnamed Item, Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal, Unnamed Item, Improved approximations for the minimum-cut ratio and the flux, Blocking and anti-blocking pairs of polyhedra, Ship Traffic Optimization for the Kiel Canal, Rerouting Flows when Links Fail, Unnamed Item, Unnamed Item, Unnamed Item, Optimizing Traffic Signal Timings for Mega Events., Distributed shortest-path protocols for time-dependent networks, No-Wait Scheduling for Locks, The out‐of‐kilter algorithm for solving network problems, Prolong the Lifetime of Wireless Sensor Networks Through Mobility: A General Optimization Framework, Quantum Strassen’s theorem, Some Results on Sparse Matrices, Finding real-valued single-source shortest paths in o(n 3) expected time, Exhaustive testing of almost all devices with outputs depending on limited number of inputs, Local conditions for the stochastic comparison of particle systems, Optimal Component Quality Planning in Multi-State Computer Networks, A hierarchical approach for metal parts fabrication, Unnamed Item, Unnamed Item, More pathological examples for network flow problems, COMBINATORIAL YAMABE FLOW ON SURFACES, Graphs with the Circuit Cover Property, On the complexity of discrete programming problems, Unnamed Item, Matrices with restricted elements, row sums and column sums, Suboptimal cuts: Their enumeration, weight and number, Variational principles for circle patterns and Koebe’s theorem, Approximation Algorithms for k-Hurdle Problems, Unnamed Item, Unnamed Item, Zur Lösung des Zuordnungsproblems bei zwei Zielgrößen, On the width-length inequality, Dynamic Atomic Congestion Games with Seasonal Flows, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs, Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks, A network flow approach to a city emergency evacuation planning, Queuing effects in the solution of constrained store-and-forward network flow problems, Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation, Analyse und Synthese zuverlässiger Netze, Optimal Evacuation Solutions for Large-Scale Scenarios, Unnamed Item, The symmetric group, ordered by refinement of cycles, is strongly Sperner, Simple algebraic algorithm for determination of the generic-rank of structured systems, Competitive Algorithms for Layered Graph Traversal, Finding the k Shortest Paths, Optimal Tradeoffs in Matched Designs Comparing US-Trained and Internationally Trained Surgeons, The flow circulation sharing problem, UNLEASHING THE VERMIN (VECTORED ROUTE-LENGTH MINIMIZATION), Synthesis of single-product networks, Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow, On quantum network coding, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, Monotone Optimierungsaufgaben, Matching, Euler tours and the Chinese postman, Analysis of Biological Data by Graph Theory Approach Searching of Iron in Biological Cells, Packing rooted directed cuts in a weighted directed graph, Validation of subgradient optimization, Balanced and Approximate Zero-Variance Recursive Estimators for the Network Reliability Problem, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning, A bad network problem for the simplex method and other minimum cost flow algorithms, Optimal expansion of an existing network, Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks
