A branch-and-cut algorithm for the generalized communication tree network design
We consider the generalized communication tree network design problem. For given traffic requirement and wiring cost between each pair of nodes, k-types of link facilities with various capacities and costs, and the capacity of each node, the problem is to find the tree network which satisfies the given traffic requirements and minimizes total wiring and link facility cost. We formulate the problem using path variables rather than flow variables. To solve the LP relaxation which has exponentially many variables, we develop a polynomial time column generation procedure. Moreover, to tighten the formulation, an efficient preprocessing procedure is devised and some classes of strong cutting plane are developed. Using the results we develop a Branch-and-Cut algorithm where an efficient branching rule is adopted. Computational results show that the algorithm can solve practically sized problems to optimality within reasonable time and is superior to the approaches using flow variables.
- OSTI ID:
- 36205
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A branch-and-cut algorithm for the bandwidth packing problem
Branch-and-cut: Column generation for solving huge integer programs