The capacity expansion path problem in networks

DOI10.1155/2013/156901MaRDI QIDQ364264zbMATH OpenOpenAlexWikidataFDO

Authors Jianping Li, Juanping Zhu

Publication date 9 September 2013

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/156901

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Communication networks in operations research (90B18)

Recommendations

• Capacity expansion problem on an undirected network
• A constrained capacity expansion problem on networks
• The capacity expansion problem on directed networks
• On the optimum capacity of capacity expansion problems
• Computational and Information Science

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A class of bottleneck expansion problems
• An improved FPTAS for Restricted Shortest Path.
• Approximation Schemes for the Restricted Shortest Path Problem
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Incremental network optimization: theory and algorithms
• Network flows. Theory, algorithms, and applications.
• On a routing problem
• On the bottleneck capacity expansion problems on networks

Cited in

(6)

• Optimal expansion of capacitated transshipment networks
• A heuristic approach for capacity expansion of packet networks
• The capacity expansion problem on directed networks
• Expanding maximum capacity path under weighted sum-type distances
• Capacity expansion problem on an undirected network
• A constrained capacity expansion problem on networks

This page was built for publication: The capacity expansion path problem in networks

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