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.

On exact solutions to the Euclidean bottleneck Steiner tree problem

2010 ◽  
Vol 110 (16) ◽  
pp. 672-678 ◽  
Author(s):  
Sang Won Bae ◽  
Chunseok Lee ◽  
Sunghee Choi
Keyword(s):  
Exact Solutions ◽  
Steiner Tree ◽  
Steiner Tree Problem ◽  
Bottleneck Steiner Tree

Exact Algorithms for the Bottleneck Steiner Tree Problem

Algorithmica ◽  
2011 ◽  
Vol 61 (4) ◽  
pp. 924-948 ◽  
Author(s):  
Sang Won Bae ◽  
Sunghee Choi ◽  
Chunseok Lee ◽  
Shin-ichi Tanigawa
Keyword(s):  
Steiner Tree ◽  
Exact Algorithms ◽  
Steiner Tree Problem ◽  
Bottleneck Steiner Tree
Sign in / Sign up

Export Citation Format

Share Document