.png){kind=icon}
返回
ATM VP-based network design
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(03)00372-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of designing an ATM VP-based leased line backbone network. Given point-to-point communication demands having predefined sizes in a network, the problem is to find configurations of demand routes and link facilities installed on each edge satisfying all demands at minimum cost under some constraints. One of the most important constraints is that a single demand cannot be split over multiple link facilities. This is a sort of bin packing constraint. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a valid inequality is used to strengthen the integer programming formulation. The algorithm incorporates the column generation technique and the cutting plane approach into a branch-and-bound scheme. We test the proposed algorithm on some real problems. The results show that the algorithm can be used to solve the problems within reasonably small computing times. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
integer programming
column generation
cutting plane
bin packing
routing
telecommunications
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
A simple load balancing scheme for task allocation in parallel machines.png)
Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91
OAAI
Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91IF0
OAAI分享收藏
分享收藏 没有更多内容
没有更多内容