Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms
详细信息 查看全文
- 作者：Xiangyong Li ; a ; xyli@tongji.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Y.P. Anejab ; aneja@uwindsor.ca" class="auth_mail" title="E-mail the corresponding author
- 关键词：Optical network design ; Regenerator placement ; Integer programming ; Branch and cut ; Facets
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：16 February 2017
- 年：2017
- 卷：257
- 期：1
- 页码：25-40
- 全文大小：994 K
文摘
- •
We study the regenerator location problem (RLP).
- •
We study the facial structure of the polytope arising from a set covering formulation.
- •
Making use of these polyhedral results, we present a new branch-and-cut approach.
- •
Results over 447 benchmark instances demonstrate the performance of our method.