Multi-Overlay network planning by applying a variable neighbourhood search approach.
Supervisor(es): Robledo, Franco
Resumen:
This thesis presents an approach for the topological design and sizing of an IP/MPLSmultioverlay network with the purpose of minimising the economical resources involved on ANTEL (Administración Nacional de Telecomunicaciones) infrastructure. The overlay network is an MPLS Data Network, which physically exchange traffic over an existent Transport infrastructure. The solution to find must be of optimal cost, robust to simple failures in the Transport Network, and deal with differential traffic. The mathematical model for this kind of problems is obtained by using weighted graphs which leads to a combinatorial optimisation formulation. As the problem undertaken is NP-Hard concerning computational complexity, a metaheuristic methodology is employed, which reaches approximate though often optimal solutions in a reasonable time. The metaheuristic selected is VNS (Variable Neihbourhood Search), which has shown positive qualities as simplicity, efficiency and effectiveness among others. Then, the implemented local searches and achieved results are described.
2010 | |
TELECOMUNICACION REDES DE ORDENADORES PROGRAMACION MATEMATICA |
|
Inglés | |
Universidad de la República | |
COLIBRI | |
https://hdl.handle.net/20.500.12008/24270 | |
Acceso abierto | |
Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0) |
_version_ | 1807523175745978368 |
---|---|
author | Corez, Andrés |
author_facet | Corez, Andrés |
author_role | author |
bitstream.checksum.fl_str_mv | 6429389a7df7277b72b7924fdc7d47a9 a006180e3f5b2ad0b88185d14284c0e0 d77747f0b79dbc4c411d2260a3d95cd2 1996b8461bc290aef6a27d78c67b6b52 0243de04bdbf61fe458cf67e6617c1a8 |
bitstream.checksumAlgorithm.fl_str_mv | MD5 MD5 MD5 MD5 MD5 |
bitstream.url.fl_str_mv | http://localhost:8080/xmlui/bitstream/20.500.12008/24269/5/license.txt http://localhost:8080/xmlui/bitstream/20.500.12008/24269/2/license_url http://localhost:8080/xmlui/bitstream/20.500.12008/24269/3/license_text http://localhost:8080/xmlui/bitstream/20.500.12008/24269/4/license_rdf http://localhost:8080/xmlui/bitstream/20.500.12008/24269/1/Cor10.pdf |
collection | COLIBRI |
dc.contributor.filiacion.none.fl_str_mv | Corez Andrés, Universidad de la República (Uruguay). Facultad de Ingeniería. |
dc.coverage.spatial.es.fl_str_mv | Uruguay, Antel (Compañía estatal de telecomunicaciones) |
dc.creator.advisor.none.fl_str_mv | Robledo, Franco |
dc.creator.none.fl_str_mv | Corez, Andrés |
dc.date.accessioned.none.fl_str_mv | 2020-06-10T18:41:11Z |
dc.date.available.none.fl_str_mv | 2020-06-10T18:41:11Z |
dc.date.issued.none.fl_str_mv | 2010 |
dc.description.abstract.none.fl_txt_mv | This thesis presents an approach for the topological design and sizing of an IP/MPLSmultioverlay network with the purpose of minimising the economical resources involved on ANTEL (Administración Nacional de Telecomunicaciones) infrastructure. The overlay network is an MPLS Data Network, which physically exchange traffic over an existent Transport infrastructure. The solution to find must be of optimal cost, robust to simple failures in the Transport Network, and deal with differential traffic. The mathematical model for this kind of problems is obtained by using weighted graphs which leads to a combinatorial optimisation formulation. As the problem undertaken is NP-Hard concerning computational complexity, a metaheuristic methodology is employed, which reaches approximate though often optimal solutions in a reasonable time. The metaheuristic selected is VNS (Variable Neihbourhood Search), which has shown positive qualities as simplicity, efficiency and effectiveness among others. Then, the implemented local searches and achieved results are described. |
dc.format.extent.es.fl_str_mv | 119 p. |
dc.format.mimetype.es.fl_str_mv | application/pdf |
dc.identifier.citation.es.fl_str_mv | Corez, A. Multi-Overlay network planning by applying a variable neighbourhood search approach [en línea] Tesis de maestría. Montevideo : Udelar. FI, 2010. |
dc.identifier.issn.none.fl_str_mv | 1688-2792 |
dc.identifier.uri.none.fl_str_mv | https://hdl.handle.net/20.500.12008/24270 |
dc.language.iso.none.fl_str_mv | en eng |
dc.publisher.es.fl_str_mv | Udelar.FI. |
dc.rights.license.none.fl_str_mv | Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0) |
dc.rights.none.fl_str_mv | info:eu-repo/semantics/openAccess |
dc.source.none.fl_str_mv | reponame:COLIBRI instname:Universidad de la República instacron:Universidad de la República |
dc.subject.other.es.fl_str_mv | TELECOMUNICACION REDES DE ORDENADORES PROGRAMACION MATEMATICA |
dc.title.none.fl_str_mv | Multi-Overlay network planning by applying a variable neighbourhood search approach. |
dc.type.es.fl_str_mv | Tesis de maestría |
dc.type.none.fl_str_mv | info:eu-repo/semantics/masterThesis |
dc.type.version.none.fl_str_mv | info:eu-repo/semantics/acceptedVersion |
description | This thesis presents an approach for the topological design and sizing of an IP/MPLSmultioverlay network with the purpose of minimising the economical resources involved on ANTEL (Administración Nacional de Telecomunicaciones) infrastructure. The overlay network is an MPLS Data Network, which physically exchange traffic over an existent Transport infrastructure. The solution to find must be of optimal cost, robust to simple failures in the Transport Network, and deal with differential traffic. The mathematical model for this kind of problems is obtained by using weighted graphs which leads to a combinatorial optimisation formulation. As the problem undertaken is NP-Hard concerning computational complexity, a metaheuristic methodology is employed, which reaches approximate though often optimal solutions in a reasonable time. The metaheuristic selected is VNS (Variable Neihbourhood Search), which has shown positive qualities as simplicity, efficiency and effectiveness among others. Then, the implemented local searches and achieved results are described. |
eu_rights_str_mv | openAccess |
format | masterThesis |
id | COLIBRI_c87d01ae089b83ddf1ac361b3d48925a |
identifier_str_mv | Corez, A. Multi-Overlay network planning by applying a variable neighbourhood search approach [en línea] Tesis de maestría. Montevideo : Udelar. FI, 2010. 1688-2792 |
instacron_str | Universidad de la República |
institution | Universidad de la República |
instname_str | Universidad de la República |
language | eng |
language_invalid_str_mv | en |
network_acronym_str | COLIBRI |
network_name_str | COLIBRI |
oai_identifier_str | oai:colibri.udelar.edu.uy:20.500.12008/24269 |
publishDate | 2010 |
reponame_str | COLIBRI |
repository.mail.fl_str_mv | mabel.seroubian@seciu.edu.uy |
repository.name.fl_str_mv | COLIBRI - Universidad de la República |
repository_id_str | 4771 |
rights_invalid_str_mv | Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0) |
spelling | Corez Andrés, Universidad de la República (Uruguay). Facultad de Ingeniería.Uruguay, Antel (Compañía estatal de telecomunicaciones)2020-06-10T18:41:11Z2020-06-10T18:41:11Z2010Corez, A. Multi-Overlay network planning by applying a variable neighbourhood search approach [en línea] Tesis de maestría. Montevideo : Udelar. FI, 2010.1688-2792https://hdl.handle.net/20.500.12008/24270This thesis presents an approach for the topological design and sizing of an IP/MPLSmultioverlay network with the purpose of minimising the economical resources involved on ANTEL (Administración Nacional de Telecomunicaciones) infrastructure. The overlay network is an MPLS Data Network, which physically exchange traffic over an existent Transport infrastructure. The solution to find must be of optimal cost, robust to simple failures in the Transport Network, and deal with differential traffic. The mathematical model for this kind of problems is obtained by using weighted graphs which leads to a combinatorial optimisation formulation. As the problem undertaken is NP-Hard concerning computational complexity, a metaheuristic methodology is employed, which reaches approximate though often optimal solutions in a reasonable time. The metaheuristic selected is VNS (Variable Neihbourhood Search), which has shown positive qualities as simplicity, efficiency and effectiveness among others. Then, the implemented local searches and achieved results are described.Submitted by Ribeiro Jorge (jribeiro@fing.edu.uy) on 2020-06-10T17:36:14Z No. of bitstreams: 2 license_rdf: 23149 bytes, checksum: 1996b8461bc290aef6a27d78c67b6b52 (MD5) Cor10.pdf: 3222171 bytes, checksum: 0243de04bdbf61fe458cf67e6617c1a8 (MD5)Approved for entry into archive by Machado Jimena (jmachado@fing.edu.uy) on 2020-06-10T18:30:44Z (GMT) No. of bitstreams: 2 license_rdf: 23149 bytes, checksum: 1996b8461bc290aef6a27d78c67b6b52 (MD5) Cor10.pdf: 3222171 bytes, checksum: 0243de04bdbf61fe458cf67e6617c1a8 (MD5)Made available in DSpace by Luna Fabiana (fabiana.luna@fic.edu.uy) on 2020-06-10T18:41:11Z (GMT). No. of bitstreams: 2 license_rdf: 23149 bytes, checksum: 1996b8461bc290aef6a27d78c67b6b52 (MD5) Cor10.pdf: 3222171 bytes, checksum: 0243de04bdbf61fe458cf67e6617c1a8 (MD5) Previous issue date: 2010119 p.application/pdfenengUdelar.FI.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)info:eu-repo/semantics/openAccessLicencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0)TELECOMUNICACIONREDES DE ORDENADORESPROGRAMACION MATEMATICAMulti-Overlay network planning by applying a variable neighbourhood search approach.Tesis de maestríainfo:eu-repo/semantics/masterThesisinfo:eu-repo/semantics/acceptedVersionreponame:COLIBRIinstname:Universidad de la Repúblicainstacron:Universidad de la RepúblicaCorez, AndrésRobledo, FrancoUniversidad de la República (Uruguay). Facultad de Ingeniería.Magíster en Ingeniería (Ingeniería Matemática)LICENSElicense.txtlicense.txttext/plain; charset=utf-84267http://localhost:8080/xmlui/bitstream/20.500.12008/24269/5/license.txt6429389a7df7277b72b7924fdc7d47a9MD55CC-LICENSElicense_urllicense_urltext/plain; charset=utf-850http://localhost:8080/xmlui/bitstream/20.500.12008/24269/2/license_urla006180e3f5b2ad0b88185d14284c0e0MD52license_textlicense_texttext/html; charset=utf-838687http://localhost:8080/xmlui/bitstream/20.500.12008/24269/3/license_textd77747f0b79dbc4c411d2260a3d95cd2MD53license_rdflicense_rdfapplication/rdf+xml; charset=utf-823149http://localhost:8080/xmlui/bitstream/20.500.12008/24269/4/license_rdf1996b8461bc290aef6a27d78c67b6b52MD54ORIGINALCor10.pdfCor10.pdfapplication/pdf3222171http://localhost:8080/xmlui/bitstream/20.500.12008/24269/1/Cor10.pdf0243de04bdbf61fe458cf67e6617c1a8MD5120.500.12008/242692020-10-28 12:27:42.201oai:colibri.udelar.edu.uy:20.500.12008/24269VGVybWlub3MgeSBjb25kaWNpb25lcyByZWxhdGl2YXMgYWwgZGVwb3NpdG8gZGUgb2JyYXMKCgpMYXMgb2JyYXMgZGVwb3NpdGFkYXMgZW4gZWwgUmVwb3NpdG9yaW8gc2UgcmlnZW4gcG9yIGxhIE9yZGVuYW56YSBkZSBsb3MgRGVyZWNob3MgZGUgbGEgUHJvcGllZGFkIEludGVsZWN0dWFsICBkZSBsYSBVbml2ZXJzaWRhZCBEZSBMYSBSZXDDumJsaWNhLiAoUmVzLiBOwrogOTEgZGUgQy5ELkMuIGRlIDgvSUlJLzE5OTQg4oCTIEQuTy4gNy9JVi8xOTk0KSB5ICBwb3IgbGEgT3JkZW5hbnphIGRlbCBSZXBvc2l0b3JpbyBBYmllcnRvIGRlIGxhIFVuaXZlcnNpZGFkIGRlIGxhIFJlcMO6YmxpY2EgKFJlcy4gTsK6IDE2IGRlIEMuRC5DLiBkZSAwNy8xMC8yMDE0KS4gCgpBY2VwdGFuZG8gZWwgYXV0b3IgZXN0b3MgdMOpcm1pbm9zIHkgY29uZGljaW9uZXMgZGUgZGVww7NzaXRvIGVuIENPTElCUkksIGxhIFVuaXZlcnNpZGFkIGRlIFJlcMO6YmxpY2EgcHJvY2VkZXLDoSBhOiAgCgphKSBhcmNoaXZhciBtw6FzIGRlIHVuYSBjb3BpYSBkZSBsYSBvYnJhIGVuIGxvcyBzZXJ2aWRvcmVzIGRlIGxhIFVuaXZlcnNpZGFkIGEgbG9zIGVmZWN0b3MgZGUgZ2FyYW50aXphciBhY2Nlc28sIHNlZ3VyaWRhZCB5IHByZXNlcnZhY2nDs24KYikgY29udmVydGlyIGxhIG9icmEgYSBvdHJvcyBmb3JtYXRvcyBzaSBmdWVyYSBuZWNlc2FyaW8gIHBhcmEgZmFjaWxpdGFyIHN1IHByZXNlcnZhY2nDs24geSBhY2Nlc2liaWxpZGFkIHNpbiBhbHRlcmFyIHN1IGNvbnRlbmlkby4KYykgcmVhbGl6YXIgbGEgY29tdW5pY2FjacOzbiBww7pibGljYSB5IGRpc3BvbmVyIGVsIGFjY2VzbyBsaWJyZSB5IGdyYXR1aXRvIGEgdHJhdsOpcyBkZSBJbnRlcm5ldCBtZWRpYW50ZSBsYSBwdWJsaWNhY2nDs24gZGUgbGEgb2JyYSBiYWpvIGxhIGxpY2VuY2lhIENyZWF0aXZlIENvbW1vbnMgc2VsZWNjaW9uYWRhIHBvciBlbCBwcm9waW8gYXV0b3IuCgoKRW4gY2FzbyBxdWUgZWwgYXV0b3IgaGF5YSBkaWZ1bmRpZG8geSBkYWRvIGEgcHVibGljaWRhZCBhIGxhIG9icmEgZW4gZm9ybWEgcHJldmlhLCAgcG9kcsOhIHNvbGljaXRhciB1biBwZXLDrW9kbyBkZSBlbWJhcmdvIHNvYnJlIGxhIGRpc3BvbmliaWxpZGFkIHDDumJsaWNhIGRlIGxhIG1pc21hLCBlbCBjdWFsIGNvbWVuemFyw6EgYSBwYXJ0aXIgZGUgbGEgYWNlcHRhY2nDs24gZGUgZXN0ZSBkb2N1bWVudG8geSBoYXN0YSBsYSBmZWNoYSBxdWUgaW5kaXF1ZSAuCgpFbCBhdXRvciBhc2VndXJhIHF1ZSBsYSBvYnJhIG5vIGluZnJpZ2UgbmluZ8O6biBkZXJlY2hvIHNvYnJlIHRlcmNlcm9zLCB5YSBzZWEgZGUgcHJvcGllZGFkIGludGVsZWN0dWFsIG8gY3VhbHF1aWVyIG90cm8uCgpFbCBhdXRvciBnYXJhbnRpemEgcXVlIHNpIGVsIGRvY3VtZW50byBjb250aWVuZSBtYXRlcmlhbGVzIGRlIGxvcyBjdWFsZXMgbm8gdGllbmUgbG9zIGRlcmVjaG9zIGRlIGF1dG9yLCAgaGEgb2J0ZW5pZG8gZWwgcGVybWlzbyBkZWwgcHJvcGlldGFyaW8gZGUgbG9zIGRlcmVjaG9zIGRlIGF1dG9yLCB5IHF1ZSBlc2UgbWF0ZXJpYWwgY3V5b3MgZGVyZWNob3Mgc29uIGRlIHRlcmNlcm9zIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIHkgcmVjb25vY2lkbyBlbiBlbCB0ZXh0byBvIGNvbnRlbmlkbyBkZWwgZG9jdW1lbnRvIGRlcG9zaXRhZG8gZW4gZWwgUmVwb3NpdG9yaW8uCgpFbiBvYnJhcyBkZSBhdXRvcsOtYSBtw7psdGlwbGUgL3NlIHByZXN1bWUvIHF1ZSBlbCBhdXRvciBkZXBvc2l0YW50ZSBkZWNsYXJhIHF1ZSBoYSByZWNhYmFkbyBlbCBjb25zZW50aW1pZW50byBkZSB0b2RvcyBsb3MgYXV0b3JlcyBwYXJhIHB1YmxpY2FybGEgZW4gZWwgUmVwb3NpdG9yaW8sIHNpZW5kbyDDqXN0ZSBlbCDDum5pY28gcmVzcG9uc2FibGUgZnJlbnRlIGEgY3VhbHF1aWVyIHRpcG8gZGUgcmVjbGFtYWNpw7NuIGRlIGxvcyBvdHJvcyBjb2F1dG9yZXMuCgpFbCBhdXRvciBzZXLDoSByZXNwb25zYWJsZSBkZWwgY29udGVuaWRvIGRlIGxvcyBkb2N1bWVudG9zIHF1ZSBkZXBvc2l0YS4gTGEgVURFTEFSIG5vIHNlcsOhIHJlc3BvbnNhYmxlIHBvciBsYXMgZXZlbnR1YWxlcyB2aW9sYWNpb25lcyBhbCBkZXJlY2hvIGRlIHByb3BpZWRhZCBpbnRlbGVjdHVhbCBlbiBxdWUgcHVlZGEgaW5jdXJyaXIgZWwgYXV0b3IuCgpBbnRlIGN1YWxxdWllciBkZW51bmNpYSBkZSB2aW9sYWNpw7NuIGRlIGRlcmVjaG9zIGRlIHByb3BpZWRhZCBpbnRlbGVjdHVhbCwgbGEgVURFTEFSICBhZG9wdGFyw6EgdG9kYXMgbGFzIG1lZGlkYXMgbmVjZXNhcmlhcyBwYXJhIGV2aXRhciBsYSBjb250aW51YWNpw7NuIGRlIGRpY2hhIGluZnJhY2Npw7NuLCBsYXMgcXVlIHBvZHLDoW4gaW5jbHVpciBlbCByZXRpcm8gZGVsIGFjY2VzbyBhIGxvcyBjb250ZW5pZG9zIHkvbyBtZXRhZGF0b3MgZGVsIGRvY3VtZW50byByZXNwZWN0aXZvLgoKTGEgb2JyYSBzZSBwb25kcsOhIGEgZGlzcG9zaWNpw7NuIGRlbCBww7pibGljbyBhIHRyYXbDqXMgZGUgbGFzIGxpY2VuY2lhcyBDcmVhdGl2ZSBDb21tb25zLCBlbCBhdXRvciBwb2Ryw6Egc2VsZWNjaW9uYXIgdW5hIGRlIGxhcyA2IGxpY2VuY2lhcyBkaXNwb25pYmxlczoKCgpBdHJpYnVjacOzbiAoQ0MgLSBCeSk6IFBlcm1pdGUgdXNhciBsYSBvYnJhIHkgZ2VuZXJhciBvYnJhcyBkZXJpdmFkYXMsIGluY2x1c28gY29uIGZpbmVzIGNvbWVyY2lhbGVzLCBzaWVtcHJlIHF1ZSBzZSByZWNvbm96Y2EgYWwgYXV0b3IuCgpBdHJpYnVjacOzbiDigJMgQ29tcGFydGlyIElndWFsIChDQyAtIEJ5LVNBKTogUGVybWl0ZSB1c2FyIGxhIG9icmEgeSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcywgaW5jbHVzbyBjb24gZmluZXMgY29tZXJjaWFsZXMsIHBlcm8gbGEgZGlzdHJpYnVjacOzbiBkZSBsYXMgb2JyYXMgZGVyaXZhZGFzIGRlYmUgaGFjZXJzZSBtZWRpYW50ZSB1bmEgbGljZW5jaWEgaWTDqW50aWNhIGEgbGEgZGUgbGEgb2JyYSBvcmlnaW5hbCwgcmVjb25vY2llbmRvIGEgbG9zIGF1dG9yZXMuCgpBdHJpYnVjacOzbiDigJMgTm8gQ29tZXJjaWFsIChDQyAtIEJ5LU5DKTogUGVybWl0ZSB1c2FyIGxhIG9icmEgeSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcywgc2llbXByZSB5IGN1YW5kbyBlc29zIHVzb3Mgbm8gdGVuZ2FuIGZpbmVzIGNvbWVyY2lhbGVzLCByZWNvbm9jaWVuZG8gYWwgYXV0b3IuCgpBdHJpYnVjacOzbiDigJMgU2luIERlcml2YWRhcyAoQ0MgLSBCeS1ORCk6IFBlcm1pdGUgZWwgdXNvIGRlIGxhIG9icmEsIGluY2x1c28gY29uIGZpbmVzIGNvbWVyY2lhbGVzLCBwZXJvIG5vIHNlIHBlcm1pdGUgZ2VuZXJhciBvYnJhcyBkZXJpdmFkYXMsIGRlYmllbmRvIHJlY29ub2NlciBhbCBhdXRvci4KCkF0cmlidWNpw7NuIOKAkyBObyBDb21lcmNpYWwg4oCTIENvbXBhcnRpciBJZ3VhbCAoQ0Mg4oCTIEJ5LU5DLVNBKTogUGVybWl0ZSB1c2FyIGxhIG9icmEgeSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcywgc2llbXByZSB5IGN1YW5kbyBlc29zIHVzb3Mgbm8gdGVuZ2FuIGZpbmVzIGNvbWVyY2lhbGVzIHkgbGEgZGlzdHJpYnVjacOzbiBkZSBsYXMgb2JyYXMgZGVyaXZhZGFzIHNlIGhhZ2EgbWVkaWFudGUgbGljZW5jaWEgaWTDqW50aWNhIGEgbGEgZGUgbGEgb2JyYSBvcmlnaW5hbCwgcmVjb25vY2llbmRvIGEgbG9zIGF1dG9yZXMuCgpBdHJpYnVjacOzbiDigJMgTm8gQ29tZXJjaWFsIOKAkyBTaW4gRGVyaXZhZGFzIChDQyAtIEJ5LU5DLU5EKTogUGVybWl0ZSB1c2FyIGxhIG9icmEsIHBlcm8gbm8gc2UgcGVybWl0ZSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcyB5IG5vIHNlIHBlcm1pdGUgdXNvIGNvbiBmaW5lcyBjb21lcmNpYWxlcywgZGViaWVuZG8gcmVjb25vY2VyIGFsIGF1dG9yLgoKTG9zIHVzb3MgcHJldmlzdG9zIGVuIGxhcyBsaWNlbmNpYXMgaW5jbHV5ZW4gbGEgZW5hamVuYWNpw7NuLCByZXByb2R1Y2Npw7NuLCBjb211bmljYWNpw7NuLCBwdWJsaWNhY2nDs24sIGRpc3RyaWJ1Y2nDs24geSBwdWVzdGEgYSBkaXNwb3NpY2nDs24gZGVsIHDDumJsaWNvLiBMYSBjcmVhY2nDs24gZGUgb2JyYXMgZGVyaXZhZGFzIGluY2x1eWUgbGEgYWRhcHRhY2nDs24sIHRyYWR1Y2Npw7NuIHkgZWwgcmVtaXguCgpDdWFuZG8gc2Ugc2VsZWNjaW9uZSB1bmEgbGljZW5jaWEgcXVlIGhhYmlsaXRlIHVzb3MgY29tZXJjaWFsZXMsIGVsIGRlcMOzc2l0byBkZWJlcsOhIHNlciBhY29tcGHDsWFkbyBkZWwgYXZhbCBkZWwgamVyYXJjYSBtw6F4aW1vIGRlbCBTZXJ2aWNpbyBjb3JyZXNwb25kaWVudGUuCg==Universidadhttps://udelar.edu.uy/https://www.colibri.udelar.edu.uy/oai/requestmabel.seroubian@seciu.edu.uyUruguayopendoar:47712024-07-25T14:44:06.000172COLIBRI - Universidad de la Repúblicafalse |
spellingShingle | Multi-Overlay network planning by applying a variable neighbourhood search approach. Corez, Andrés TELECOMUNICACION REDES DE ORDENADORES PROGRAMACION MATEMATICA |
status_str | acceptedVersion |
title | Multi-Overlay network planning by applying a variable neighbourhood search approach. |
title_full | Multi-Overlay network planning by applying a variable neighbourhood search approach. |
title_fullStr | Multi-Overlay network planning by applying a variable neighbourhood search approach. |
title_full_unstemmed | Multi-Overlay network planning by applying a variable neighbourhood search approach. |
title_short | Multi-Overlay network planning by applying a variable neighbourhood search approach. |
title_sort | Multi-Overlay network planning by applying a variable neighbourhood search approach. |
topic | TELECOMUNICACION REDES DE ORDENADORES PROGRAMACION MATEMATICA |
url | https://hdl.handle.net/20.500.12008/24270 |