.png){kind=icon}
返回
A decomposition algorithm for the ring spur assignment problem
.png){kind=icon}
OA
AI
DOI：10.1111/j.1475-3995.2012.00867.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes the ring spur assignment problem (RSAP), a new problem arising in the design of next generation networks. The RSAP complements the sonet ring assignment problem (SRAP). We describe the RSAP, positioning it in relation to problems previously addressed in the literature. We decompose the problem into two IP problems and describe a branch-and-cut decomposition heuristic algorithm suitable for solving problem instances in a reasonable time. We present promising computational results.
Keyword:
networks
graphs
applications
combinatorics
integer programming formulation
telecommunications network topology design
cutting plane algorithm
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
分享收藏21<sup>st</sup> Century challenges of clean energy and global warming-can energy storage systems meet these issues?.png)
2010 3rd International Conference on Thermal Issues in Emerging Technologies Theory and Applications
2010 3rd International Conference on Thermal Issues in Emerging Technologies Theory and ApplicationsIF0
PREAI
分享收藏
分享收藏
查看更多内容