Determining the optimal paths in networks with rated transition time costs
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 1 (2014), pp. 14-22
Voir la notice de l'article provenant de la source Math-Net.Ru
We formulate and study the problem of determining the optimal paths in networks with rated transition time costs on edges. Polynomial time algorithms for determining the optimal solution of this problem are proposed and grounded. The proposed algorithms generalize algorithms for determining the optimal paths in the weighted directed graphs.
@article{BASM_2014_1_a1,
author = {Dmitrii Lozovanu},
title = {Determining the optimal paths in networks with rated transition time costs},
journal = {Buletinul Academiei de \c{S}tiin\c{t}e a Republicii Moldova. Matematica},
pages = {14--22},
publisher = {mathdoc},
number = {1},
year = {2014},
language = {en},
url = {http://geodesic.mathdoc.fr/item/BASM_2014_1_a1/}
}
TY - JOUR AU - Dmitrii Lozovanu TI - Determining the optimal paths in networks with rated transition time costs JO - Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica PY - 2014 SP - 14 EP - 22 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/BASM_2014_1_a1/ LA - en ID - BASM_2014_1_a1 ER -
Dmitrii Lozovanu. Determining the optimal paths in networks with rated transition time costs. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 1 (2014), pp. 14-22. http://geodesic.mathdoc.fr/item/BASM_2014_1_a1/