Chuong, Tran and Nam, Ha (2019) A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem. In: Context-Aware Systems and Applications, and Nature of Computation and Communication. 7th EAI International Conference, ICCASA 2018, and 4th EAI International Conference, ICTCC 2018, Viet Tri City, Vietnam, November 22–23, 2018, Proceedings.
28926.pdf
Download (1MB)
Abstract
Steiner Minimal Tree (SMT) is a complex optimization problem that has many important applications in science and technology; This is a NP-hard problem. Much research has been carried out to solve the SMT problem using approximate algorithms. This paper presents a variable neighborhood search (VNS) algorithm for solving the SMT problem; The proposed algorithm has been tested on sparse graphs in a standardized experimental data system, and it yields better results than some other heuristic algorithms.
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 11:37 |
| Last Modified: | 20 Nov 2026 13:09 |
| URI: | https://eprints.eai.eu/id/eprint/19954 |
