Routing through virtual paths in layered telecommunication networks
Please always quote using this URN: urn:nbn:de:0297-zib-2070
- We study a network configuration problem in telecommunications where one wants to set up paths in a capacitated network to accommodate given point-to-point traffic demand. The problem is formulated as an integer linear programming model where 0-1 variables represent different paths. An associated integral polytope is studied and different classes of facets are described. These results are used in a cutting plane algorithm. Computational results for some realistic problems are reported.
Author: | Geir Dahl, Alexander Martin, Mechthild Stoer |
---|---|
Document Type: | ZIB-Report |
Date of first Publication: | 1995/11/29 |
Series (Serial Number): | ZIB-Report (SC-95-41) |
ZIB-Reportnumber: | SC-95-41 |
Published in: | Appeared in: Operations Research 47 (5) 1999 pp. 693-702 |