A bicriterion Steiner tree problem on graph

A bicriterion Steiner tree problem on graph

0.00 Avg rating0 Votes
Article ID: iaor20041830
Country: Serbia
Volume: 13
Issue: 1
Start Page Number: 25
End Page Number: 33
Publication Date: Jan 2003
Journal: YUGOR
Authors: ,
Keywords: graphs, programming: multiple criteria
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 minisum Steiner tree problem under the constraint on capacity of the tree. The paper also presents some computational experiments with the multicriteria problem.

Reviews

Required fields are marked *. Your email address will not be published.