Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F22%3APU146097" target="_blank" >RIV/00216305:26210/22:PU146097 - isvavai.cz</a>
Result on the web
<a href="https://wseas.com/journals/computers/2022/a625105-028(2022).pdf" target="_blank" >https://wseas.com/journals/computers/2022/a625105-028(2022).pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.37394/23205.2022.21.31" target="_blank" >10.37394/23205.2022.21.31</a>
Alternative languages
Result language
angličtina
Original language name
Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS
Original language description
The Steiner tree problem in graphs involves finding a minimum cost tree which connects a defined subset of the vertices. This problem generalises the minimum spanning tree problem, in contrast, it is NP-complete and is usually solved for large instances by deterministic or stochastic heuristic methods and approximate algorithms. In this paper, however, we focus on a different approach, based on the formulation of a mixed integer programming model and its modification for solving in the professional optimization tool GAMS, which is now capable of solving even large instances of problems of exponential complexity.
Czech name
—
Czech description
—
Classification
Type
J<sub>ost</sub> - Miscellaneous article in a specialist periodical
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2022
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
Name of the periodical
WSEAS Transactions on Computers
ISSN
1109-2750
e-ISSN
—
Volume of the periodical
21
Issue of the periodical within the volume
July
Country of publishing house
GR - GREECE
Number of pages
6
Pages from-to
257-262
UT code for WoS article
—
EID of the result in the Scopus database
—