Routing through virtual paths in layered telecommunication networks

Routing through virtual paths in layered telecommunication networks

0.00 Avg rating0 Votes
Article ID: iaor20011102
Country: United States
Volume: 47
Issue: 5
Start Page Number: 693
End Page Number: 702
Publication Date: Sep 1999
Journal: Operations Research
Authors: , ,
Keywords: networks, programming: integer
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.