A bicriterion Steiner tree problem on graph
Апстракт
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 minimums Steiner tree problem under the constraint on capacity of the tree. The paper also presents some computational experiments with the multicriteria problem.
Кључне речи:
Steiner tree / lexicographic method / bottleneck problem / bicriterion optimizationИзвор:
Yugoslav Journal of Operations Research, 2003, 13, 1, 25-33Издавач:
- Univerzitet u Beogradu - Fakultet organizacionih nauka, Beograd, i dr.
Институција/група
Fakultet organizacionih naukaTY - JOUR AU - Vujošević, Mirko AU - Stanojević, Milan PY - 2003 UR - https://rfos.fon.bg.ac.rs/handle/123456789/261 AB - 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 minimums Steiner tree problem under the constraint on capacity of the tree. The paper also presents some computational experiments with the multicriteria problem. PB - Univerzitet u Beogradu - Fakultet organizacionih nauka, Beograd, i dr. T2 - Yugoslav Journal of Operations Research T1 - A bicriterion Steiner tree problem on graph EP - 33 IS - 1 SP - 25 VL - 13 DO - 10.2298/YJOR0301025V UR - conv_191 ER -
@article{ author = "Vujošević, Mirko and Stanojević, Milan", year = "2003", abstract = "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 minimums Steiner tree problem under the constraint on capacity of the tree. The paper also presents some computational experiments with the multicriteria problem.", publisher = "Univerzitet u Beogradu - Fakultet organizacionih nauka, Beograd, i dr.", journal = "Yugoslav Journal of Operations Research", title = "A bicriterion Steiner tree problem on graph", pages = "33-25", number = "1", volume = "13", doi = "10.2298/YJOR0301025V", url = "conv_191" }
Vujošević, M.,& Stanojević, M.. (2003). A bicriterion Steiner tree problem on graph. in Yugoslav Journal of Operations Research Univerzitet u Beogradu - Fakultet organizacionih nauka, Beograd, i dr.., 13(1), 25-33. https://doi.org/10.2298/YJOR0301025V conv_191
Vujošević M, Stanojević M. A bicriterion Steiner tree problem on graph. in Yugoslav Journal of Operations Research. 2003;13(1):25-33. doi:10.2298/YJOR0301025V conv_191 .
Vujošević, Mirko, Stanojević, Milan, "A bicriterion Steiner tree problem on graph" in Yugoslav Journal of Operations Research, 13, no. 1 (2003):25-33, https://doi.org/10.2298/YJOR0301025V ., conv_191 .