On equivalent representations of certain multicommodity networks as single commodity flow problems

DOI10.1007/BF01609003zbMath0392.90029OpenAlexW2036734225MaRDI QIDQ4174500

James R. Evans

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01609003

zbMATH Keywords

AlgorithmsMulticommodity Network FlowMulticommodity Transportation Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Graphic matroids and the multicommodity transportation problem
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• A Noniterative Algorithm for Tridiagonal Transportation Problems and Its Generalization

This page was built for publication: On equivalent representations of certain multicommodity networks as single commodity flow problems