On multiroute maximum flows in networks
From MaRDI portal
Publication:2782731
DOI10.1002/net.10008zbMath1074.90049OpenAlexW2161556771WikidataQ59592575 ScholiaQ59592575MaRDI QIDQ2782731
James B. Orlin, Charu C. Aggarwal
Publication date: 8 April 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/2655
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Related Items
Multi-terminal multipath flows: synthesis ⋮ Flows over edge-disjoint mixed multipaths and applications ⋮ An approximation algorithm for multiroute flow decomposition ⋮ Path Problems in Complex Networks ⋮ Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ Rerouting Flows when Links Fail ⋮ Fractional routing using pairs of failure-disjoint paths ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ Short length Menger's theorem and reliable optical routing ⋮ Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem ⋮ Integer version of the multipath flow network synthesis problem ⋮ The complexity of computing a robust flow ⋮ Impact of a varying capacity on the all pairs 2-route network flows ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Multiroute flows: cut-trees and realizability ⋮ A set covering approach for multi-depot train driver scheduling ⋮ An improved algorithm for decomposing arc flows into multipath flows
Cites Work
