Wamiliana, Wamiliana and Mustofa, Mustofa and Warsono, Warsono and Warsito, Warsito (2019) Computational Aspects of Some Algorithms for The Multiperiod Degree Constrained Minimum Spanning Tree Problem. Journal of Physics: IOP Conf. Series: Journal of Physics: Conf. Series 1338 (2019) 012034 doi:10.1088/1742-6596/1338/1/012034, 1338. pp. 1-6.
|
Text
Wamiliana_2019_J._Phys.__Conf._Ser._1338_012034.pdf Download (787kB) | Preview |
Abstract
Abstract. Given a graph G(V,E), where V is the set of vertices and E is the set of edges connecting vertices in V, and for every edge eij there is an associated weight cij ≥0, The Multi Period Degree Constrained Minimum Spanning Tree (MPDCMST) is a problem of finding an MST while also considering the degree constrained on every vertex, and satisfying vertices installation on every period. The restriction on the vertex installation is needed due to some conditions such as fund limitation, harsh weather, and so on. In this research some algorithms developed to solve the MPDCMST Problem will be discussed and compared. Keywords: multi periods, degree constrained, minimum spanning tree, computational aspect, comparative analysis
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika |
| Depositing User: | WAMILIANA |
| Date Deposited: | 04 Nov 2019 09:24 |
| Last Modified: | 04 Nov 2019 09:24 |
| URI: | http://repository.lppm.unila.ac.id/id/eprint/15361 |
Actions (login required)
 |
View Item |