Affiliation:
1. Institute of Automation and Computer Science Brno University of Technology Technick´a 2, 616 69 Brno CZECH REPUBLIC
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.
Publisher
World Scientific and Engineering Academy and Society (WSEAS)
Reference27 articles.
1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, New Jersey, 1993. ISBN 0-13-617549- X.
2. S. Balaji, K. Kannan, and Y. B. Venkatakrishnan. Total Dominating Set Based Algorithm for Connected Dominating Set in Ad hoc Wireless Networks. WSEAS Transactions on Mathematics, 12:1164–1172, 2013.
3. V. K. Balakrishnan. Network Optimization. Chapman & Hall Mathematics, London, 1995.
4. J. E. Beasley. OR-Library. Report, The Management School Imperial College, London, 1996. http://mscmga.ms.ic.ac.uk/info.html.
5. C. Bentz, M.-C. Costa, and A. Herty. On the Edge Capacitated Steiner Tree Problem. Discrete Optimization, 38:1–25, 2020.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献