A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem
From MaRDI portal
Publication:4099434
DOI10.1007/BF01580684zbMath0333.90050OpenAlexW1995894828MaRDI QIDQ4099434
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580684
Programming involving graphs or networks (90C35) Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Unnamed Item, An algorithm to evaluate the system reliability for multicommodity case under cost constraint, Determinacy in Linear Systems and Networks, On equivalent representations of certain multicommodity networks as single commodity flow problems, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm