Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Lentz, Antonin"'
Autor:
Lentz, Antonin
Publikováno v:
Algorithme et structure de données [cs.DS]. Université de Bordeaux, 2021. Français. ⟨NNT : 2021BORD0179⟩
This thesis focuses on the computation of approximate multicriteria shortest paths. In a multicriteria context, computing the Pareto sets, i.e. all the optimal solutions, is often prohibitive. Many approaches consist in computing only a subset. Some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::97f99d53aed1c9e1a9eb67419e650af5
https://tel.archives-ouvertes.fr/tel-03346036/document
https://tel.archives-ouvertes.fr/tel-03346036/document
Publikováno v:
20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020), Sep 2020, Pisa (virtual), Italy. pp.11:1-11:19, ⟨10.4230/OASIcs.ATMOS.2020.11⟩
20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020), Sep 2020, Pisa (virtual), Italy. pp.11:1-11:19, ⟨10.4230/OASIcs.ATMOS.2020.11⟩
This paper deals with the computation of d-dimensional multicriteria shortest paths. In a weighted graph with arc weights represented by vectors, the cost of a path is the vector sum of the weights of its arcs. For a given pair consisting of a source
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::353aa03b9a2f0d475914c7e761d4f29e
https://hal.archives-ouvertes.fr/hal-03034585/file/OASIcs-ATMOS-2020-11.pdf
https://hal.archives-ouvertes.fr/hal-03034585/file/OASIcs-ATMOS-2020-11.pdf