通信学报2001，Vol.22Issue(4)：101-107,7.
ATM网络虚通道路由规划问题的一种新解法
A new method for VP route program problem in ATM networks
摘要
Abstract
In this paper the VP route program problem(VPR)in ATM networks is analyzed The problem is transformed into a kind of bottleneck multiple choice integer program problem(BMCIP). According to the characteristic of the problem,a new effective method based on improved heuristic cluster local search and the branch and cut method is presented to get the global optimal solution. Compared with the simulation results of local search and tabu search methods, the method in this paper seems very effective.关键词
虚通道路由规划/瓶颈多选择整数规划/局部搜索/分枝剪枝分类
信息技术与安全科学引用本文复制引用
郭伟,席裕庚..ATM网络虚通道路由规划问题的一种新解法[J].通信学报,2001,22(4):101-107,7.
