Title of article :
Bidirected and unidirected capacity installation in telecommunication networks Original Research Article
Author/Authors :
Stan P.M van Hoesel، نويسنده , , ARIE M.C.A. KOSTER، نويسنده , , Robert L.M.J van de Leensel، نويسنده , , Martin W.P. Savelsbergh، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Pages :
19
From page :
103
To page :
121
Abstract :
In the design of telecommunication networks, decisions concerning capacity installation and routing of commodities have to be taken simultaneously. Network Loading problems formalize these decisions in mathematical optimization models. Several variants of the problem exist: bifurcated or non-bifurcated routing, bidirected or unidirected capacity installation, and symmetric versus non-symmetric routing restrictions. Moreover, different concepts of reliability can be considered. In this paper, we study the polyhedral structure of two basic problems for non-bifurcated routing: network loading with bidirected and unidirected capacity installation.
Keywords :
Network loading , Polyhedral combinatorics , Telecommunication network design , Branch-and-cut
Journal title :
Discrete Applied Mathematics
Serial Year :
2003
Journal title :
Discrete Applied Mathematics
Record number :
885738
Link To Document :
بازگشت