Multi-Commodity Network Flows
From MaRDI portal
Publication:5736116
DOI10.1287/opre.11.3.344zbMath0123.23704OpenAlexW2150815458MaRDI QIDQ5736116
No author found.
Publication date: 1963
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.11.3.344
Related Items
On the complexity of barrier resilience for fat regions and bounded ply, A cutting plane algorithm for computing \(k\)-edge survivability of a network, Families of cuts with the MFMC-property, Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes, A survey on flows in graphs and matroids, An approximate max-flow min-cut relation for undirected multicommodity flow, with applications, The geometry of graphs and some of its algorithmic applications, Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem, Decomposition's Dantzig-Wolfe applied to fuzzy multicommodity flow problems, A polynomial time approximation algorithm for the two-commodity splittable flow problem, Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity, Three commodity flows in graphs, Multiflows and disjoint paths of minimum total cost, On fractional multicommodity flows and distance functions, Polyhedra related to undirected multicommodity flows, Distances and cuts in planar graphs, Subspaces with well-scaled frames, System capacity for a two-commodity multistate flow network with unreliable nodes and capacity weight, A \(T_X\)-approach to some results on cuts and metrics, A short proof of the two-commodity flow theorem, Some problems in discrete optimization, On the fractionality of the path packing problem, Approximating minimum feedback sets and multi-cuts in directed graphs, Cut-sufficient directed 2-commodity multiflow topologies, Concurrent flows and packet routing in Cayley graphs (Preliminary version), Packing odd circuits in Eulerian graphs, Disjoint paths in graphs, 2-linked graphs, Improved approximations for the minimum-cut ratio and the flux, On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint, Multicommodity flows in planar graphs, Blocking and anti-blocking pairs of polyhedra, A partitioning algorithm for the multicommodity network flow problem, Two commodity network flows and linear programming, Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems, Quasi-balanced matrices, Matroids and multicommodity flows, Unnamed Item, The Maximum Flow Problem for Oriented Flows, The ellipsoid method and its consequences in combinatorial optimization, Tree metrics and edge-disjoint \(S\)-paths, Criticality for multicommodity flows, Generating cut conjunctions in graphs and related problems, An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts, A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals, Short proofs on multicommodity flows and cuts, Maximum concurrent flows and minimum cuts, Analysis of budget for interdiction on multicommodity network flows, Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs, Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths, On cuts and matchings in planar graphs, Performance evaluation for a transportation system in stochastic case, Ideal clutters, A cycle augmentation algorithm for minimum cost multicommodity flows on a ring, The biobjective undirected two-commodity minimum cost flow problem, Minimal multicut and maximal integer multiflow: a survey, A new strategy for the undirected two-commodity maximum flow problem, Multiflows in symmetric digraphs, Disjoint paths in graphs. (Reprint), Study on the multicommodity reliability of a capacitated-flow network, Simple and improved parameterized algorithms for multiterminal cuts, On the hardness of finding near-optimal multicuts in directed acyclic graphs, Half-integral five-terminus flows, Correlation clustering in general weighted graphs, Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange, Eisenberg-Gale markets: algorithms and game-theoretic properties, The matroids with the max-flow min-cut property, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, On describing the routing capacity regions of networks, A two-commodity cut theorem, Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem, A node-capacitated Okamura-Seymour theorem, Multicommodity flows in certain planar directed networks, Anti-blocking polyhedra, Projections of the capacitated network loading problem, Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs, Tight spans of distances and the dual fractionality of undirected multiflow problems, Multicommodity flows in graphs, On some weakly bipartite graphs, Metrics and undirected cuts, Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network, A fast algorithm for maximum integral two-commodity flow in planar graphs, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
