A new effective mathematical programming model to design CDN topology
The Steiner Tree Problem is an umbrella of combinatorial optimization problems in graphs, most of them NP-Hard, within which, the Steiner Tree Problem in graphs (STP) is perhaps one of the most famous and widely studied. The STP consists in optimally interconnect a given set of terminal or mandatory...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/20.500.12008/26247 |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: A new effective mathematical programming model to design CDN topology
- Predicting the performance of a parallel heuristic solution for the Steiner Tree Problem
- Approximation and interpolation of divergence free flows.
- Proposal of two visual tree risk assessment methods for urban parks in Montevideo, Uruguay. [Propuesta de dos métodos de evaluación visual del riesgo de árboles para parques urbanos en Montevideo, Uruguay.]
- Tree models :algorithms and information theoretic properties
- Solving the Generalized Steiner Problem in edge-survivable networks
- Disentangling the invasion process of subtropical native forests of Uruguay by the exotic tree Ligustrum lucidum: establishment and dominance determinants