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 th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Belgrade
2003-01-01
|
| Series: | Yugoslav Journal of Operations Research |
| Subjects: | |
| Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2003/0354-02430301025V.pdf |
| _version_ | 1818347708651405312 |
|---|---|
| author | Vujošević Mirko B. Stanojević Milan |
| author_facet | Vujošević Mirko B. Stanojević Milan |
| author_sort | Vujošević Mirko B. |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-13T17:38:28Z |
| format | Article |
| id | doaj.art-0be602b279264bf2b5acfdf4dcc121b4 |
| institution | Directory Open Access Journal |
| issn | 0354-0243 1820-743X |
| language | English |
| last_indexed | 2024-12-13T17:38:28Z |
| publishDate | 2003-01-01 |
| publisher | University of Belgrade |
| record_format | Article |
| series | Yugoslav Journal of Operations Research |
| spelling | doaj.art-0be602b279264bf2b5acfdf4dcc121b42022-12-21T23:36:51ZengUniversity of BelgradeYugoslav Journal of Operations Research0354-02431820-743X2003-01-01131253310.2298/YJOR0301025VA bicriterion Steiner tree problem on graphVujošević Mirko B.Stanojević MilanThis 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.http://www.doiserbia.nb.rs/img/doi/0354-0243/2003/0354-02430301025V.pdfSteiner treebicriterion optimizationbottleneck problemlexicographic method |
| spellingShingle | Vujošević Mirko B. Stanojević Milan A bicriterion Steiner tree problem on graph Yugoslav Journal of Operations Research Steiner tree bicriterion optimization bottleneck problem lexicographic method |
| title | A bicriterion Steiner tree problem on graph |
| title_full | A bicriterion Steiner tree problem on graph |
| title_fullStr | A bicriterion Steiner tree problem on graph |
| title_full_unstemmed | A bicriterion Steiner tree problem on graph |
| title_short | A bicriterion Steiner tree problem on graph |
| title_sort | bicriterion steiner tree problem on graph |
| topic | Steiner tree bicriterion optimization bottleneck problem lexicographic method |
| url | http://www.doiserbia.nb.rs/img/doi/0354-0243/2003/0354-02430301025V.pdf |
| work_keys_str_mv | AT vujosevicmirkob abicriterionsteinertreeproblemongraph AT stanojevicmilan abicriterionsteinertreeproblemongraph AT vujosevicmirkob bicriterionsteinertreeproblemongraph AT stanojevicmilan bicriterionsteinertreeproblemongraph |