Multi-Commodity Network Flows
From MaRDI portal
Publication:5736116
DOI10.1287/opre.11.3.344zbMath0123.23704MaRDI 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
Improved approximations for the minimum-cut ratio and the flux, Some problems in discrete optimization, Blocking and anti-blocking pairs of polyhedra, A partitioning algorithm for the multicommodity network flow problem, Two commodity network flows and linear programming, A cycle augmentation algorithm for minimum cost multicommodity flows on a ring, Study on the multicommodity reliability of a capacitated-flow network, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs, On cuts and matchings in planar graphs, Ideal clutters, The biobjective undirected two-commodity minimum cost flow problem, Minimal multicut and maximal integer multiflow: a survey, A short proof of the two-commodity flow theorem, Disjoint paths in graphs, 2-linked graphs, Short proofs on multicommodity flows and cuts, Maximum concurrent flows and minimum cuts, The matroids with the max-flow min-cut property, A two-commodity cut theorem, A fast algorithm for maximum integral two-commodity flow in planar graphs, Multiflows and disjoint paths of minimum total cost, A \(T_X\)-approach to some results on cuts and metrics, Packing odd circuits in Eulerian graphs, Projections of the capacitated network loading problem, A cutting plane algorithm for computing \(k\)-edge survivability of a network, An approximate max-flow min-cut relation for undirected multicommodity flow, with applications, The geometry of graphs and some of its algorithmic applications, Anti-blocking polyhedra, Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs, Quasi-balanced matrices
