Models and algorithms for the reconfiguration of distributed wireless switching systems

被引:0
作者
Renaud Sirdey
机构
[1] Nortel GSM Access R&D,Service d’architecture BSC (PC 12A7)
[2] Université de Technologie de Compiègne,Laboratoire Heudiasyc
来源
4OR | 2008年 / 6卷
关键词
Scheduling; Polyhedral combinatorics; Branch-and-bound; Branch-and-cut; Simulated annealing; Distributed systems; 68M20; 90C57; 90C59; 68M14;
D O I
暂无
中图分类号
学科分类号
摘要
This paper is a summary of the author’s PhD thesis entitled “Models and algorithms for the reconfiguration of wireless switching systems”. The thesis deals with the study of a strongly NP-hard resource-constrained scheduling problem arising from the telecommunication industry. This work was supervised by Jacques Carlier and Dritan Nace, both from Université de Technologie de Compiègne, and carried out while the author was a System Architect within Nortel GSM Access R&D organization. The thesis, which is written in both French and English, has been defended on 29 March 2007 and is available by email request to the author.
引用
收藏
页码:195 / 198
页数:3
相关论文
共 2 条
[1]  
Józsa BG(2003)On the solution of reroute sequence planning problem in MPLS networks Comput Networks 42 199-210
[2]  
Makai M(undefined)undefined undefined undefined undefined-undefined