Single Commodity Representation of Multicommodity Networks
From MaRDI portal
Publication:3964300
DOI10.1137/0601040zbMath0498.90033MaRDI QIDQ3964300
Publication date: 1980
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0601040
efficient algorithm; multicommodity flow; equivalent problem transformation; single commodity flow; directed multicommodity flow network
90B10: Deterministic network models in operations research
Related Items
Unnamed Item, Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Matroids and Graphs
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks
- Unimodular matrices of flow problems with additional constraints
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks
- 2-Isomorphic Graphs
- From Matrices to Graphs