Submodularity and combinatorial representations for the multicommodity network design problem
| dc.contributor.advisor | Ortiz Astorquiza, Camilo | |
| dc.contributor.advisor | Contreras, Ivan | |
| dc.contributor.author | Gutierrez Diaz, Diana Carolina | |
| dc.date.accessioned | 2022-04-08T14:55:22Z | |
| dc.date.accessioned | 2024-02-27T19:53:17Z | |
| dc.date.available | 2022-04-08T14:55:22Z | |
| dc.date.available | 2024-02-27T19:53:17Z | |
| dc.date.created | 2022-03-25 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12032/123109 | |
| dc.description.abstract | Presentamos una nueva representación combinatoria para el problema de diseño de redes multiproducto (MUND), tal que su función objetivo satisface la propiedad de submodularidad. Gracias a la propiedad de submodularidad es posible establecer heurísticas, para dos variantes del problema, tales que dichas heurísticas sean algoritmos de aproximación que corren en tiempo polinomial y para los cuales es posible establecer cotas del peor caso de 1/e para grandes instancias. | spa |
| dc.format | spa | |
| dc.format.mimetype | application/pdf | spa |
| dc.language.iso | spa | spa |
| dc.publisher | Pontificia Universidad Javeriana | spa |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | Network design | spa |
| dc.title | Submodularity and combinatorial representations for the multicommodity network design problem | spa |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| Carta_de_autorizacion (1).pdf | 88.19Kb | application/pdf | View/ |
| Tesis arregrada.pdf | 1.257Mb | application/pdf | View/ |
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc-nd/4.0/