Capacity expansion problem on an undirected network

MaRDI QIDQ2720046zbMATH OpenFDO

Authors Hongguo Wang, Shaohan Ma

Publication date 26 June 2001

Published in Journal of Shandong University. Natural Science Edition (Search for Journal in Brave)

zbMATH Keywords

constrained capacitystrongly polynomial algorithmundirected networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Circuits, networks (94C99)

Recommendations

• The capacity expansion problem on directed networks
• A constrained capacity expansion problem on networks
• The capacity expansion path problem in networks
• On the optimum capacity of capacity expansion problems
• On the bottleneck capacity expansion problems on networks

Cited in

(9)

• A heuristic approach for capacity expansion of packet networks
• The capacity expansion problem on directed networks
• Research on network max-flow Pareto expansion problem
• The capacity expansion path problem in networks
• A constrained capacity expansion problem on networks
• An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
• Computational and Information Science
• Multiperiod capacity expansion of road networks: Formulation and algorithms
• The complexity of flow expansion and electrical flow expansion

This page was built for publication: Capacity expansion problem on an undirected network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2720046)