Combinatorial approaches to multiflow problems
From MaRDI portal
Publication:1080357
DOI10.1016/0166-218X(85)90004-6zbMath0598.90036OpenAlexW4210485603MaRDI QIDQ1080357
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(85)90004-6
Related Items
On the complexity of the disjoint paths problem, Application of cut polyhedra. I, Applications of cut polyhedra. II, Robust Metric Inequalities for Network Loading Under Demand Uncertainty, Network loading problem: valid inequalities from 5- and higher partitions, Graphic vertices of the metric polytope, Polyhedra related to undirected multicommodity flows, When Do Gomory--Hu Subtrees Exist?, One-third-integrality in the max-cut problem, A \(T_X\)-approach to some results on cuts and metrics, On the fractionality of the path packing problem, On tight spans for directed distances, Cut-sufficient directed 2-commodity multiflow topologies, Packing odd circuits in Eulerian graphs, Fixed charge multicommodity network design using \(p\)-partition facets, Solving survivable two-layer network design problems by metric inequalities, Multiflow Feasibility: An Annotated Tableau, Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems, Unnamed Item, Unnamed Item, On return path packing., New methods for multi-commodity flows, Criticality for multicommodity flows, Short proofs on multicommodity flows and cuts, A canonical decomposition theory for metrics on a finite set, On ideal clutters, metrics and multiflows, Maximum concurrent flows and minimum cuts, Ideal clutters, Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard, Multiflows in symmetric digraphs, Half-integral five-terminus flows, Polyhedral structure of the 4-node network design problem, On the binary solitaire cone, Sums of cuts and bipartite metrics, Railway scheduling by network optimization, Maximum balanced flow in a network, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, Tight spans of distances and the dual fractionality of undirected multiflow problems, On one maximum multiflow problem and related metrics, On extremal multiflows, New approaches for optimizing over the semimetric polytope, On multiflow lexicographics, About Lagrangian methods in integer optimization
Cites Work
