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: | Vujošević Mirko B., Stanojević Milan |
---|---|
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 |
Similar Items
-
Optimization of Steiner trees search in the flow Steiner tree problem
by: Valery Kukin
Published: (2018-06-01) -
A Relation of Dominance for the Bicriterion Bus Routing Problem
by: Widuch Jacek
Published: (2017-03-01) -
Geometric Steiner minimal trees
by: De Wet, Pieter Oloff
Published: (2009) -
Geometric Steiner minimal trees
by: De Wet, Pieter Oloff
Published: (2009) -
The Steiner Ratio for the Obstacle-Avoiding Steiner Tree Problem
by: Razaghpour, Mina
Published: (2008)