Robust Steiner Tree with uncertain edge costs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41110%2F21%3A85447" target="_blank" >RIV/60460709:41110/21:85447 - isvavai.cz</a>
Result on the web
<a href="https://www.ekf.vsb.cz/smsis/en/" target="_blank" >https://www.ekf.vsb.cz/smsis/en/</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Robust Steiner Tree with uncertain edge costs
Original language description
Steiner Tree problem is a problem of combinatorial optimization and a special case of minimum spanning tree problem. Similarly to the minimum spanning tree, we are looking for a minimum connection of vertices while in the case of Steiner tree, some additional vertices may be used to achieve an improvement in the objective function. In this paper, we consider a situation where some of the edge costs are not specifically set and ranging in a predefined symmetrical interval instead. The problem is formulated as an integer linear program and a way of building the robust equivalent of the model is described using the gamma-robustness approach. The proposed approach is demonstrated on a semi-artificial case of an electrical grid for different degrees of uncertainty measured by algebraic function. The results justify the profitability of using Steiner vertices in the model and the expected increase in the costs related to different degrees of uncertainty is calculated.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 14th International Conference Strategic Management and its support by Information Systems 2021
ISBN
978-80-248-4521-0
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
92-101
Publisher name
VSB Technical University of Ostrava
Place of publication
Ostrava
Event location
Ostrava
Event date
May 25, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—