Dissertation/ Thesis
MATHEMATICAL PROGRAMMING ALGORITHMS FOR NETWORK OPTIMIZATION PROBLEMS
| العنوان: | MATHEMATICAL PROGRAMMING ALGORITHMS FOR NETWORK OPTIMIZATION PROBLEMS |
|---|---|
| المؤلفون: | F. Colombo |
| المساهمون: | tutor: M. Trubian, co-tutor: R. Cordone, coordinator: G. Naldi, F. Colombo, TRUBIAN, MARCO, NALDI, GIOVANNI |
| بيانات النشر: | Università degli Studi di Milano |
| سنة النشر: | 2014 |
| المجموعة: | The University of Milan: Archivio Istituzionale della Ricerca (AIR) |
| مصطلحات موضوعية: | Operations Research, Network Optimization, Column Generation, Column and Row Generation, Settore MAT/09 - Ricerca Operativa |
| الوصف: | In the thesis we consider combinatorial optimization problems that are defined by means of networks. These problems arise when we need to take effective decisions to build or manage network structures, both satisfying the design constraints and minimizing the costs. In the thesis we focus our attention on the four following problems: - The Multicast Routing and Wavelength Assignment with Delay Constraint in WDM networks with heterogeneous capabilities (MRWADC) problem: this problem arises in the telecommunications industry and it requires to define an efficient way to make multicast transmissions on a WDM optical network. In more formal terms, to solve the MRWADC problem we need to identify, in a given directed graph that models the WDM optical network, a set of arborescences that connect the source of the transmission to all its destinations. These arborescences need to satisfy several quality-of-service constraints and need to take into account the heterogeneity of the electronic devices belonging to the WDM network. - The Homogeneous Area Problem (HAP): this problem arises from a particular requirement of an intermediate level of the Italian government called province. Each province needs to coordinate the common activities of the towns that belong to its territory. To practically perform its coordination role, the province of Milan created a customer care layer composed by a certain number of employees that have the task to support the towns of the province in their administrative works. For the sake of efficiency, the employees of this customer care layer have been partitioned in small groups and each group is assigned to a particular subset of towns that have in common a large number of activities. The HAP requires to identify the set of towns assigned to each group in order to minimize the redundancies generated by the towns that, despite having some activities in common, have been assigned to different groups. Since, for both historical and practical reasons, the towns in a particular subset need to be ... |
| نوع الوثيقة: | doctoral or postdoctoral thesis |
| اللغة: | English |
| Relation: | http://hdl.handle.net/2434/234164 |
| DOI: | 10.13130/colombo-fabio_phd2014-03-28 |
| الاتاحة: | http://hdl.handle.net/2434/234164 https://doi.org/10.13130/colombo-fabio_phd2014-03-28 |
| Rights: | info:eu-repo/semantics/openAccess |
| رقم الانضمام: | edsbas.C04DE058 |
| قاعدة البيانات: | BASE |
| DOI: | 10.13130/colombo-fabio_phd2014-03-28 |
|---|