The capacity expansion path problem in networks

DOI10.1155/2013/156901zbMath1271.90017OpenAlexW1963694282WikidataQ59001873 ScholiaQ59001873MaRDI QIDQ364264

Juanping Zhu, Jianping Li

Publication date: 9 September 2013

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

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

Mathematics Subject Classification ID

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

Related Items (1)

Expanding maximum capacity path under weighted sum-type distances

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved FPTAS for Restricted Shortest Path.
• On the bottleneck capacity expansion problems on networks
• Incremental Network Optimization: Theory and Algorithms
• On a routing problem
• Approximation Schemes for the Restricted Shortest Path Problem
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• A class of bottleneck expansion problems

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