A heuristic approach for capacity expansion of packet networks

DOI10.1016/0377-2217(95)00089-5zbMath0920.90063OpenAlexW1985767663MaRDI QIDQ1278229

Amitava Dutta, Young Ki Kim

Publication date: 27 April 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00089-5

zbMATH Keywords

communicationheuristicscapacity expansionflow deviation routing algorithm

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• The complexity of the capacitated tree problem
• Operations Research and Capacity Expansion Problems: A Survey
• A Multiperiod Capacity Planning Model for Backbone Computer Communication Networks
• Large-Scale Network Topological Optimization
• On building minimum cost communication networks over time
• The flow deviation method: An approach to store‐and‐forward communication network design
• Minimum cost routing for dynamic network models