Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Jurnal Matematika UNAND JMT (Jurnal Matematika dan Terapan)
Kusbudiono
Universitas Jember
Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Implementasi Pencarian Rute Terpendek Tour Wisata di Banyuwangi pada Agen Travel Menggunakan Algoritma Floyd Warshall Kusbudiono; Vira Ulyatul Maghfiroh; Ikhsanul Halikin; Kristiana Wijaya
JMT : Jurnal Matematika dan Terapan Vol 5 No 2 (2023): JMT (Jurnal Matematika dan Terapan)
Publisher : Program Studi Matematika Universitas Negeri Jakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21009/jmt.5.2.1

Abstract

Tourism is travel aim to visit tourist attractions. Holidays to tourist attractions can eliminate boredom, improve the brain's work system, and foster a feeling of happiness. Holidays to tourist attractions can be assisted by travel agents. This research was carried out by looking for the shortest route from tour packages the travel agent in Banyuwangi. Search for the shortest route is aim to save time on travel package rundown tour, the distance traveled, and the fuel used. Search for the shortest route can be calculated using Floyd Warshall Algorithm. This algorithm was chosen because it can evaluate each pair vertex at each iteration to find the shortest distance. Search for the shortest distance is checking each pair vertex and choosing the smallest distance between the actual distance and the initial distance plus the final distance. The results of this research are found in the last iteration of each tour package. The total distance of the tour package is calculated using the Floyd Warshall Algorithm to get smaller distance than the total distance of the tour package with the route taken normally. Tour package distance using Floyd Warshall Algorithm experienced distance savings seen from the difference between the two.
Sparse Matrix Factorization Using Multifrontal QR and Supernodal Cholesky Methods Moh Hasan; Chintya Monikasari; Kusbudiono
Jurnal Matematika UNAND Vol. 15 No. 3 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.3.449-459.2026

Abstract

This paper discusses the factorization of sparse matrices. A nested dissection method is used to reorder sparse matrices, while multifrontal QR and supernodal Cholesky methods are applied to factorize them. Simulations were carried out on three groups of matrices of the same size, with each group consisting of four matrices of varying sparsities. The objectives of this study are to investigate the effect of sparsity and the performance of the factorization methods. Results show that the effects of sparsity on the parameters of the matrix groups depend on their sparsity slope. Ultimately, it is demonstrated that supernodal Cholesky factorization achieves better performance than multifrontal QR.
Co-Authors Chintya Monikasari Ikhsanul Halikin, Ikhsanul Kristiana Wijaya Moh Hasan Vira Ulyatul Maghfiroh