The multiroute maximum flow problem revisited

DOI10.1002/net.20099zbMath1116.90020OpenAlexW4237640572MaRDI QIDQ5469126

R. Chandrasekaran, Dong-lei Du

Publication date: 16 May 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20099

zbMATH Keywords

Newton's methodparametric flowmultiroute flowaugmenting-path

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53) Deterministic network models in operations research (90B10)

Related Items (3)

Sensitivity analysis on the all pairsq-route flows in a network ⋮ Parametric multiroute flow and its application to multilink-attack network ⋮ An improved algorithm for decomposing arc flows into multipath flows

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization
• Maximal Flow Through a Network

This page was built for publication: The multiroute maximum flow problem revisited