Por favor, use este identificador para citar o enlazar este ítem:
https://hdl.handle.net/20.500.12008/3461
Cómo citar
Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.contributor.author | Sartor, Pablo | es |
| dc.contributor.author | Robledo Amoza, Franco Rafael | es |
| dc.date.accessioned | 2014-12-02T16:06:24Z | - |
| dc.date.available | 2014-12-02T16:06:24Z | - |
| dc.date.issued | 2011 | es |
| dc.date.submitted | 20141202 | es |
| dc.identifier.citation | SARTOR, P., ROBLEDO AMOZA, F. "Solving the Generalized Steiner Problem in edge-survivable networks". Reportes Técnicos 11-09. UR. FI – INCO, 2011. | es |
| dc.identifier.issn | 0797-6410 | es |
| dc.identifier.uri | http://hdl.handle.net/20.500.12008/3461 | - |
| dc.description.abstract | The Generalized Steiner Problem with Edge-Connectivity constraints (GSP-EC) consists of computing the minimal cost subnetwork of a given feasible network where some pairs of nodes must satisfy edge-connectivity requirements. It can be applied in the design of communications networks where connection lines can fail and is known to be an NP-Complete problem. In this paper we introduce an algorithm based on GRASP (Greedy Randomized Adaptive Search Procedure), a combinatorial optimization metaheuristic that has proven to be very effective for such problems. Promising results are obtained when testing the algorithm over a set of heterogeneous network topologies and connectivity requirements; in all cases with known optimal cost, optimal or near-optimal solutions are found. | es |
| dc.format.extent | 17 p. | es |
| dc.format.mimetype | application/pdf | es |
| dc.language | in | es |
| dc.publisher | UR. FI – INCO. | es |
| dc.relation.ispartof | Reportes Técnicos 11-09 | es |
| dc.rights | Las obras depositadas en el Repositorio se rigen por la Ordenanza de los Derechos de la Propiedad Intelectual de la Universidad De La República. (Res. Nº 91 de C.D.C. de 8/III/1994 – D.O. 7/IV/1994) y por la Ordenanza del Repositorio Abierto de la Universidad de la República (Res. Nº 16 de C.D.C. de 07/10/2014) | es |
| dc.subject | Network Design | es |
| dc.subject | Edge-connectivity | es |
| dc.subject | Survivability | es |
| dc.subject | Steiner Problems | es |
| dc.subject | Metaheuristics | es |
| dc.subject | GRASP | es |
| dc.title | Solving the Generalized Steiner Problem in edge-survivable networks | es |
| dc.type | Reporte técnico | es |
| dc.rights.licence | Licencia Creative Commons Atribución – No Comercial – Sin Derivadas (CC BY-NC-ND 4.0) | es |
| Aparece en las colecciones: | Reportes Técnicos - Instituto de Computación | |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | ||
|---|---|---|---|---|---|
| TR1109.pdf | 1,79 MB | Adobe PDF | Visualizar/Abrir |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons
