Prof. Wamiliana

The use of probability and edge analysis to solve the multi-period degree constrained minimum spanning tree problem 🆕 TERBARU 2024

Wamiliana, Junaidi, A., Gamal, M. D. H., & Thamrin, T. (2024)

Science and Technology Indonesia 9(4) : 855-862

DOI: 10.26554/sti.2024.9.4.855-862

WAC4 algorithm to solve the multiperiod degree constrained minimum spanning tree problem Algoritma WAC4

Wamiliana, Junaidi, A., Amanto, Usman, M., & Warsono (2020)

Journal of Physics: Conference Series 1524 : Article 012046

DOI: 10.1088/1742-6596/1524/1/012046

Using modification of Prims algorithm and GNU Octave to solve the multiperiods installation problem WWM1-WWM2 + GNU Octave

Wamiliana, Usman, M., Warsito, Warsono, & Daoud, J. I. (2020)

IIUM Engineering Journal 21(1) : 100-112

DOI: 10.31436/iiumej.v21i1.1088

Computational aspects of some algorithms for the multiperiod degree constrained minimum spanning tree problem

Wamiliana, Warsono, W., Mustofa, M., & Warsito, W. (2019)

Journal of Physics: Conference Series 1338 : Article 012034

DOI: 10.1088/1742-6596/1338/1/012034

Different time installation effect on the quality of the solution for the multiperiod installation problem using modified Prims algorithm WAC1 vs WAC2

Wamiliana, Warsono, Asmiati, Hijriani, A., & Hastono, W. C. (2019)

Journal of Physics: Conference Series 1338 : Article 012033

DOI: 10.1088/1742-6596/1338/1/012033

Comparative analysis of some modified Prims algorithms to solve the multiperiod degree constrained minimum spanning tree problem WAC1-3 vs WADR1-5

Wamiliana, Asmiati, Usman, M., Hijriani, A., & Hastono, W. C. (2018)

Indian Journal of Science and Technology 11(11) : 1-6

DOI: 10.17485/ijst/2018/v11i11/120968

Comparative analysis for the multi period degree constrained minimum spanning tree problem WADR3-5

Wamiliana, Amanto, & Usman, M. (2016)

Proceedings ICETD : 39-43

The hybrid of depth first search technique and Kruskals algorithm for solving the multiperiod degree constrained minimum spanning tree problem 🔄 DFS-Kruskal Hybrid

Wamiliana, Usman, M., Sakethi, D., Yuniarti, R., & Cucus, A. (2015)

Proceedings ICIDM : 1-4

DOI: 10.1109/IDM.2015.7516333

Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem

Wamiliana, Elfaki, F. A. M., Usman, M., & Azram, M. (2015)

ARPN Journal of Engineering and Applied Sciences 10(21) : 10147-10152

The design of greedy algorithm for solving the multi period degree constrained minimum spanning tree problem

Wamiliana, Sakethi, D., Junaidi, A., & Baskoro, E. T. (2012)

Jurnal Sains MIPA Universitas Lampung 3(2) : 93-96

Computational aspect of WADR1 and WADR2 algorithms for the multi period degree constrained minimum spanning tree problem WADR1-2

Wamiliana, Sakethi, D., & Yuniarti, R. (2010)

Proceedings SNMAP : 208-214

Computational aspects of greedy algorithm for solving the multi period degree constrained minimum spanning tree problem

Junaidi, A., Wamiliana, Sakethi, D., & Baskoro, E. T. (2009)

Jurnal Sains MIPA 14(1) : 1-6

Comparative analysis for the multi period degree constrained minimum spanning tree problem

Wamiliana, Amanto, & Usman, M. (2013)

Proceedings ICETD : 39-43

The design of greedy algorithm for solving the multi period degree constrained minimum spanning tree problem 📌 Paper Awal MPDCMST

Wamiliana, Sakethi, D., Junaidi, A., & Baskoro, E. T. (2005)

Jurnal Sains dan Teknologi 11(2) : 93-96

Solving the degree constrained minimum spanning tree problem using tabu and modified penalty search methods 🌟 Paper Pertama Prof. Wamiliana

Wamiliana (2004)

Jurnal Teknik Industri 6(1) : 1-9

DOI: 10.9744/jti.6.1.1-9

Tabu search based heuristics for the degree constrained minimum spanning tree problem 🤝 Kolaborasi Australia

Wamiliana & Caccetta, L. (2003)

Proceedings SEAMS : 133-140

Heuristics approach for the degree constrained minimum spanning tree Modified Penalty Methods

Caccetta, L., & Wamiliana (2001)

Proceedings MODSIM : 2161-2166

The diameter and maximum link of the minimum routing cost spanning tree problem MRCST

Sari, R. P., Wamiliana, Junaidi, A., & Susanty, W. (2022)

Science and Technology Indonesia 7(4) : 481-485

DOI: 10.26554/sti.2022.7.4.481-485

Solving the shortest total path length spanning tree problem using the modified Sollin and modified Dijkstra algorithms Shortest Total Path Length ST

Sari, R. P., Reformasari, A., Suparman, J., & Junaidi, A. (2023)

Science and Technology Indonesia 8(4) : 684-690

Penggunaan metode cutting plane untuk menyelesaikan minimum spanning tree dengan kendala bobot pada graf Kn Cutting Plane Method

Suhika, D., & Wamiliana (2018)

Aksioma: Jurnal Pendidikan Matematika 7(1)

Perbandingan kompleksitas algoritma Prim, algoritma Kruskal, dan algoritma Sollin untuk menyelesaikan masalah minimum spanning tree Complexity Analysis

Wamiliana, Kurniawan, D., & Setia, C. N. (2014)

Jurnal Komputasi 2(1) : 60-67

On some petersen graphs having locating chromatic number four or five Locating Chromatic Number

Asmiati, L. Y., Wamiliana, & Devriyadi (2017)

Far East Journal of Mathematical Sciences 102(4) : 769-778

Counting the number of disconnected vertex labelled graphs with order maximal four Graph Enumeration

Amanto, Wamiliana, Usman, M., & Sari, R. P. (2017)

Science International (Lahore) 29(6) : 1181-1186

Determining the pattern for 1-fault tolerant Hamiltonian cycle from generalized Petersen graph P(n,k) Hamiltonian Cycles

Wamiliana, Elfaki, F. A. M., Faisol, A., Usman, M., & Lestari, I. E. (2015)

International Journal of Computer Science and Network Security 15(4) : 26-30

Irregular total labeling on complete bipartite graph and union complete bipartite graphs Graph Labeling

Daoud, J. I., Wamiliana, Usman, M., & Asmiati (2010)

Conference Proceedings