A partial branch and bound design algorithm for reconfigurable networks

The joint topology, capacity and routing problem in a reconfigurable network is formulated as a nonlinear mixed integer programming problem. To solve this problem, an algorithm is presented which is a partial branch and bound algorithm. The reduced gradient method is used to solve the problem with the integrality constraints relaxed. In the computational experiments, the algorithm found good solutions and lower bounds in a few minutes of CPU time. In addition, the reduction in the minimal delay due to the reconfiguration capability can be as large as 66%.<
>