Tran, C. and Ha, N. (2018) A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem in Sparse Graphs. EAI Endorsed Transactions on Context-aware Systems and Applications.
![[thumbnail of 29337.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "29337.pdf")
PDF
29337.pdf
Download (2MB)
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) a
| Item Type: | Article |
|---|---|
| Date Deposited: | 04 Mar 2026 11:41 |
| Last Modified: | 12 Apr 2026 06:05 |
| URI: | http://eprints.eai.eu/id/eprint/20350 |
Actions (login required)
- View Item