WSEAS Transactions on Computers
Print ISSN: 1109-2750, E-ISSN: 2224-2872
Volume 21, 2022
Steiner Tree Problem in Graphs and Mixed Integer Linear Programming-Based Approach in GAMS
Author: Milos Seda
Abstract: 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.
Search Articles
Keywords: Steiner tree problem, NP-completeness, heuristic, performance ratio, network flow,
mixed-integer linear programming, GAMS
Pages: 257-262
DOI: 10.37394/23205.2022.21.31
WSEAS Transactions on Computers, ISSN / E-ISSN: 1109-2750 / 2224-2872, Volume 21, 2022, Art. #31