Opened Access Caminos Pareto-eficientes en redes: aplicaciones
Estadísticas
Icon
Exportar a
Autor: Martín Gómez, Paloma
Director: Conde Sánchez, Eduardo
Departamento: Universidad de Sevilla. Departamento de Estadística e Investigación Operativa
Fecha: 2015-06
Tipo de documento: Trabajo Fin de Grado
Titulación: Universidad de Sevilla. Grado en Matemáticas
Resumen: The problem of finding the path in a network connecting two given nodes, source and sink, with minimum possible cost is known in the literature as the shortest path problem (SPP) and it is a core model that lies at the heart of network optimization. The reason is the wide range of its practical applications and the large amount of interesting generalizations that can be considered, among them, the analysis of the multiobjective shortest path problem. This last model allows us to find how to send a given product between two specified nodes of a network as quickly, as cheaply and as reliable as possible taking into account the so-called Pareto optimal paths. The text presented here consists of two chapters. The first one is devoted to the introduction of some notation and properties related to networks where each arc is associated to just one cost value. The formulation of the SPP as a Mathematical Programming model is considered as well as its corresponding dual problem. The c...
[Ver más]
Tamaño: 374.9Kb
Formato: PDF

URI: http://hdl.handle.net/11441/40806

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones