scientific article; zbMATH DE number 508835

MaRDI QIDQ4280139zbMATH OpenFDO

Authors A. M. H. Gerards

Publication date 1 March 1994

zbMATH Keywords

disjoint pathsmulticommodity flowmax-flow min-cut property

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Polyhedra related to undirected multicommodity flows
• Hypercubes and Multicommodity Flows
• Multicommodity flows
• scientific article; zbMATH DE number 4201996
• scientific article; zbMATH DE number 3947966
• Multicommodity flows over time: Efficient algorithms and complexity
• scientific article; zbMATH DE number 2038726
• The projected pairwise multicommodity flow polyhedron

Cited in

(12)

• Integral polyhedra related to integer multicommodity flows on a cycle
• A survey on flows in graphs and matroids
• (Almost) Tight bounds and existence theorems for single-commodity confluent flows
• On ideal clutters, metrics and multiflows
• Multicommodity flows in cycle graphs
• The Klein bottle and multicommodity flows
• Packing odd circuits in Eulerian graphs
• Integer multiflows and metric packings beyond the cut condition
• A characterization of weakly bipartite graphs
• Uniform multicommodity flows in the hypercube with random edge‐capacities
• scientific article; zbMATH DE number 3906192 (Why is no real title available?)
• On combinatorial properties of binary spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4280139)