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

DOI10.1007/BF01609003zbMATH Open0392.90029OpenAlexW2036734225MaRDI QIDQ4174500FDOQ4174500

Authors: 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)

Cites Work

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

Cited In (1)

• Multicommodity network flows: A survey. II: Solution methods

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

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