1. Hop-Constrained Tree-Shaped Networks
- Author
-
Monteiro, Marta S. R., Fontes, Dalila B. M. M., Fontes, Fernando A. C. C., Departamento de Engenharia Electrotécnica e de Computadores [Porto] (DEEC), Universidade do Porto = University of Porto, Sergiy Butenko, Eduardo L. Pasiliao, Volodymyr Shylo, European Project: 264735,EC:FP7:PEOPLE,FP7-PEOPLE-2010-ITN,SADCO(2011), and Universidade do Porto
- Subjects
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC] - Abstract
International audience; Hop constraints are used to limit the number of links between two given points in a network, this way improving the quality of service by increasing the availability and reliability of the network. They have been applied to a limited number of problems, although their application can be of the greatest importance both from the academical and practical points-of-view. In this work, we survey relevant and recent works on hop-constrained problems focusing on problems with tree shaped solutions.
- Published
- 2014
- Full Text
- View/download PDF