Routing through virtual paths in layered telecommunication networks
成果类型：
Article
署名作者：
Dahl, G; Martin, A; Stoer, M
署名单位：
University of Oslo; Zuse Institute Berlin
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.47.5.693
发表日期：
1999
页码：
693-702
关键词：
摘要：
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 same realistic problems are reported.