The capacity expansion path problem in networks

DOI10.1155/2013/156901zbMATH Open1271.90017OpenAlexW1963694282WikidataQ59001873 ScholiaQ59001873MaRDI QIDQ364264FDOQ364264

Authors: Jianping Li, Juanping Zhu 

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

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

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• On a routing problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• An improved FPTAS for Restricted Shortest Path.
• Approximation Schemes for the Restricted Shortest Path Problem
• On the bottleneck capacity expansion problems on networks
• Incremental network optimization: theory and algorithms
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• A class of bottleneck expansion problems

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)