An optimization model for finding shortest paths in a road network

Simple item page
dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.advisorOinas, Silja
dc.contributor.authorParmi, Mio
dc.contributor.schoolPerustieteiden korkeakoulufi
dc.contributor.supervisorPunkka, Antti
dc.date.accessioned2021-08-29T17:13:10Z
dc.date.available2021-08-29T17:13:10Z
dc.date.issued2021-08-24
dc.format.extent36
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/109350
dc.identifier.urnURN:NBN:fi:aalto-202108298586
dc.language.isoenen
dc.programmeMaster’s Programme in Mathematics and Operations Researchfi
dc.programme.majorSystems and Operations Researchfi
dc.programme.mcodeSCI3055fi
dc.subject.keywordroutingen
dc.subject.keyworddistance matrixen
dc.subject.keywordroad networksen
dc.subject.keywordDijkstra's algorithmen
dc.subject.keywordcontraction hierarchiesen
dc.titleAn optimization model for finding shortest paths in a road networken
dc.titleOptimointimalli lyhyimpien reittien löytämiseen tieverkostossafi
dc.typeG2 Pro gradu, diplomityöfi
dc.type.ontasotMaster's thesisen
dc.type.ontasotDiplomityöfi
local.aalto.electroniconlyyes
local.aalto.openaccessno

Files

Collections

[dipl] Perustieteiden korkeakoulu / SCI