Models and algorithms for the reconfiguration of distributed wireless switching systems |
| |
Authors: | Renaud Sirdey |
| |
Affiliation: | (1) Service d’architecture BSC (PC 12A7), Nortel GSM Access R&D, Parc d’activités de Magny-Chateaufort, 78928 Yvelines Cedex 09, France;(2) Laboratoire Heudiasyc, Université de Technologie de Compiègne, Compiegne Cedex, France |
| |
Abstract: | 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. This research was supported in part by Association Nationale de la Recherche Technique grant CIFRE-121/2004. |
| |
Keywords: | Scheduling Polyhedral combinatorics Branch-and-bound Branch-and-cut Simulated annealing Distributed systems |
本文献已被 SpringerLink 等数据库收录! |
|