Open AccessA bicriterion Steiner tree problem on graph
Author(s) -
Biljana Vujošević,
Miroslav Stanojević
Publication year - 2003
Publication title -
yugoslav journal of operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.221
H-Index - 21
eISSN - 1820-743X
pISSN - 0354-0243
DOI - 10.2298/yjor0301025v
Subject(s) - steiner tree problem , mathematical optimization , k minimum spanning tree , mathematics , tree (set theory) , bottleneck , gomory–hu tree , lexicographical order , graph , k ary tree , combinatorics , computer science , tree structure , binary tree , embedded system
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