dc.contributor
Lordan González, Oriol
dc.contributor.author
Calviño Sanmartín, Pedro
dc.date.issued
2017-06-20
dc.identifier
https://hdl.handle.net/2117/188642
dc.description.abstract
The aim of this study is to define a label setting algorithm for air transport that allows to the find shortest routes between any two airports. In this case, the shortest routes will be defined as all routes within a range of time near the shortest time. The label setting algorithm will be written in C++ (and a bridge with R). Codes will be based on R and C++ package 'igraph'. Furthermore, air transport networks will be analyzed.
dc.format
application/pdf
dc.format
application/pdf
dc.format
application/pdf
dc.format
application/pdf
dc.publisher
Universitat Politècnica de Catalunya
dc.rights
Restricted access - author's decision
dc.subject
Àrees temàtiques de la UPC::Aeronàutica i espai::Aeroports
dc.title
Study of a label-setting algorithm for air transport
