.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
networks
graphs
applications
combinatorics
integer programming formulation
telecommunications network topology design
cutting plane algorithm
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K