A Kind of Bottleneck Multiple Choice Integer Program Problem and Its Solution Method
一类瓶颈多选择整数规划问题及其求解

This paper proposes a kind of bottleneck multiple choice integer program (BMCIP) problem and presents an effective solving method. On the basis of improved heuristic cluster local search, branch and cut method is used to get the global optimal solution. As a simulation example, the route program problem of virtual path (VPR) in ATM networks is transformed into this kind of problem. Comparison results between this method and the traditional search methods show that the algorithm is speedy and effective.