scholarly journals Bottleneck Steiner tree with bounded number of Steiner vertices

2015 ◽  
Vol 30 ◽  
pp. 96-100
Author(s):  
A. Karim Abu-Affash ◽  
Paz Carmi ◽  
Matthew J. Katz
Keyword(s):  
Steiner Tree ◽  
Bounded Number ◽  
Bottleneck Steiner Tree

scholarly journals A bicriterion Steiner tree problem on graph

2003 ◽  
Vol 13 (1) ◽  
pp. 25-33 ◽  
Author(s):  
Mirko Vujosevic ◽  
Milan Stanojevic
Keyword(s):  
Steiner Tree ◽  
Optimization Problem ◽  
Minimal Length ◽  
Computational Experiments ◽  
Steiner Tree Problem ◽  
Multicriteria Problem ◽  
Bottleneck Steiner Tree ◽  
Maximal Capacity

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.

Sign in / Sign up

Export Citation Format

Share Document