A Bicriterion Steiner Tree Problem on Graph
Yugoslav journal of operations research, Tome 13 (2003) no. 1, p. 25
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
This paper presents a formulation of bicriterion Steiner tree problem which
is stated as a task of finding a Steiner tree with maximal capacity and minimal length.
It is considered as a lexicographic multicriteria problem. This means that the
bottleneck Steiner tree problem is solved first. After that, the next optimization
problem is stated as a classical minisum Steiner tree problem under the constraint on
capacity of the tree. The paper also presents some computational experiments with the
multicriteria problem.
Classification :
90C27 90C29
Keywords: Steiner tree, bicriterion optimization, bottleneck problem, lexicographic method.
Keywords: Steiner tree, bicriterion optimization, bottleneck problem, lexicographic method.
Mirko Vujošević; Milan Stanojević. A Bicriterion Steiner Tree Problem on Graph. Yugoslav journal of operations research, Tome 13 (2003) no. 1, p. 25 . http://geodesic.mathdoc.fr/item/YJOR_2003_13_1_a1/
@article{YJOR_2003_13_1_a1,
author = {Mirko Vujo\v{s}evi\'c and Milan Stanojevi\'c},
title = {A {Bicriterion} {Steiner} {Tree} {Problem} on {Graph}},
journal = {Yugoslav journal of operations research},
pages = {25 },
year = {2003},
volume = {13},
number = {1},
zbl = {1065.90065},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2003_13_1_a1/}
}