A branch-and-cut algorithm for the bandwidth packing problem
We consider the bandwidth packing problem, that arises in the telecommunication network. The problem is to determine the set of calls and the assignment of them to the paths in an arc capacitated network to maximize profit. The problem is formulated by using path variables. To solve LP relaxation, an efficient column generation technique is proposed. Moreover, modified cover inequality is used to strengthen the formulation. The algorithm incorporates the column generation technique and the strong cutting plane approach into the branch-and-bound scheme. We test the proposed algorithm on several problem instances. The results show that the algorithm can be used to solve the problems to optimality within reasonably small time limits.
- OSTI ID:
- 36373
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Using column generation and Rosen`s partitioning method to solve large multi-commodity network flow problems
Solving nonlinear multicommodity flow problems with the analytic center cutting plane method