Geodesic
Multicriteria Optimum Path Problems
Yugoslav journal of operations research, Tome 5 (1995) no. 1, p. 79 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

We consider the problem of finding paths in a network between two certain nodes, when some criteria like cheep, fast, wide, reliable etc. have been posed. The problems stated below, are multicriteria and are solved by means of lexicographical ordering of the criteria. The proposed algorithms are polynomial ones,
Keywords: Multicriteria optimization, path problems, lexicographical order 
@article{YJOR_1995_5_1_a7,
     author = {Dimiter Ivanchev and Dimitris Kydros},
     title = {Multicriteria {Optimum} {Path} {Problems}},
     journal = {Yugoslav journal of operations research},
     pages = {79 },
     publisher = {mathdoc},
     volume = {5},
     number = {1},
     year = {1995},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_1995_5_1_a7/}
}
TY  - JOUR
AU  - Dimiter Ivanchev
AU  - Dimitris Kydros
TI  - Multicriteria Optimum Path Problems
JO  - Yugoslav journal of operations research
PY  - 1995
SP  - 79 
VL  - 5
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_1995_5_1_a7/
LA  - en
ID  - YJOR_1995_5_1_a7
ER  - 
%0 Journal Article
%A Dimiter Ivanchev
%A Dimitris Kydros
%T Multicriteria Optimum Path Problems
%J Yugoslav journal of operations research
%D 1995
%P 79 
%V 5
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_1995_5_1_a7/
%G en
%F YJOR_1995_5_1_a7
Dimiter Ivanchev; Dimitris Kydros. Multicriteria Optimum Path Problems. Yugoslav journal of operations research, Tome 5 (1995) no. 1, p. 79 . http://geodesic.mathdoc.fr/item/YJOR_1995_5_1_a7/