Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem

DOI10.1016/J.COR.2004.03.012zbMath1066.90047OpenAlexW2059311208WikidataQ58921638 ScholiaQ58921638MaRDI QIDQ1772874

Xianqiang Yang

Publication date: 21 April 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.03.012

zbMATH Keywords

\(K\)-route flow algorithmBinary search algorithmImplementation and computationKishimoto's algorithmMultiroute maximum flows

Mathematics Subject Classification ID

Search theory (90B40) Stochastic network models in operations research (90B15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An auction algorithm for the max-flow problem
• On multiroute maximum flows in networks
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

This page was built for publication: Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem