Routing through virtual paths in layered telecommunication networks

作     者：Dahl, G Martin, A Stoer, M 

作者机构：Univ Oslo Dept Math N-0316 Oslo Norway Konrad Zuse Zentrum Informat Tech D-10711 Berlin Germany Telenor N-2027 Kjeller Norway 

出 版 物：《OPERATIONS RESEARCH》 (Oper Res)

年 卷 期：1999年第47卷第5期

页      面：693-702页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：communications telecommunication networks/graphs design and path packing combinatorics polyhedral combinatorics 

摘      要：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.