On the bottleneck capacity expansion problems on networks

DOI10.1016/S0252-9602(06)60042-8zbMath1105.90010OpenAlexW303015190MaRDI QIDQ2495527

Zhang, Jianzhong, Chao Yang

Publication date: 30 June 2006

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0252-9602(06)60042-8

zbMATH Keywords

polynomial algorithmmaximum capacitynetworks and graphsspanning arborescence

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (2)

Expanding maximum capacity path under weighted sum-type distances ⋮ The capacity expansion path problem in networks

This page was built for publication: On the bottleneck capacity expansion problems on networks