.png){kind=icon}
返回
Benders-and-cut algorithm for fixed-charge capacitated network design problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00272-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We develop a Benders-and-cut algorithm for fixed-charge capacitated network design problem which incorporates both Benders cuts and polyhedral cuts into an implicit branch-and-bound algorithm. The algorithm is tested over a wide range of problem instances with varying sizes and traffic conditions. It is shown that this new algorithm's performance is competitive compared with existing algorithms, and that Benders cuts are more effective under heavy traffic load, while cut set inequalities are more effective under light traffic load. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
telecommunication
network design
integer programming
branch and bound
benders decomposition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
TOPOLOGICAL DESIGN OF COMPUTER-COMMUNICATION NETWORKS - THE OVERALL DESIGN PROBLEM计算机通信网络的拓扑设计-总体设计问题
PREAI
分享收藏
查看更多内容