Geodesic
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  - 
%0 Journal Article
%A Dmitrii Lozovanu
%T Determining the optimal paths in networks with rated transition time costs
%J Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
%D 2014
%P 14-22
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/BASM_2014_1_a1/
%G en
%F BASM_2014_1_a1
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/

[1] Aronson J., “A survey of dynamic network flows”, Annals of Operation Research, 20 (1989), 1–66 | DOI | MR | Zbl

[2] Christofides N., Graph Theory: An Algorithmic Approach, Academic Press, New York–London–San Francisco, 1975 | MR | Zbl

[3] Ford L., Fulkerson D., “Constructing maximal dynamic flows from static flows”, Operation Research, 6 (1958), 419–433 | DOI | MR

[4] Klinz B., Woenginger C., “Minimum cost dynamic flows: the series parallel case”, Networks, 43:3 (2004), 153–169 | DOI | MR

[5] Lozovanu D., Pickl S., Optimization and Multiobjective Control of Time-Discrete Systems, Springer, 2009 | MR | Zbl

[6] Lozovanu D., Fonoberova M., “Optimal dynamic flows in networks and algorithms for finding them”, Chapter in the book, Analysis of Complex Networks, eds. M. Dehmer, F. Emmert-Streib, Wiley, 2009, 377–400 | DOI | Zbl