Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal BAREKENG: Jurnal Ilmu Matematika dan Terapan
Ambarwati, Aditya
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Energy Engineering Mathematics Mechanical Engineering Physics Transportation

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

Found 2 Documents
Search

 1 
CONSTRUCTION OF BICYCLIC GRAPH AND ITS APPLICATION IN TRANS JOGJA ROUTES Ambarwati, Aditya; Krisnawati, Vira Hari
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 17 No 4 (2023): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol17iss4pp2095-2106

Abstract

A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same. The cycles in bicyclic graph can be of different lengths and shapes, but they must have at least one common vertex. Bicyclic graphs can be divided into two categories based on the types of induced subgraphs they contain. One category consists of graphs that include an -graph as an induced subgraph, while the other category comprises graphs that contain a -graph as an induced subgraph. There are 3 types of bicyclic graph without pendant vertex. A directed graph, also referred to as a digraph, is a graph in which each edge is assigned a specific direction. A directed bicyclic graph is a special kind of directed graph that contains precisely two distinct directed cycles. This graph can be applied in transportation problem. In this article, we give some examples of directed bicyclic graph in Trans Jogja routes.
THE BRANCH AND BOUND APPROACH TO A BOUNDED KNAPSACK PROBLEM (CASE STUDY: OPTIMIZING OF PENCAK SILAT MATCH SESSIONS) Ambarwati, Aditya; Abusini, Sobri; Krisnawati, Vira Hari
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 18 No 4 (2024): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol18iss4pp2449-2458

Abstract

A method commonly employed to solve integer programming problems is the Branch and Bound. In this article, maximizing the number of matches held on the first day of pencak silat tournaments is essential because it can impact the overall dynamics and results of the competition. The model used to maximize the number of match sessions in pencak silat competitions is a variant of the Bounded Knapsack Problem (BKP), belonging to the category of integer programming models. The result obtained using the Branch and Bound method ensures that the maximum number of match sessions can be conducted. The objective value obtained using the Branch and Bound method decreases as it descends, indicating a decreasing maximum value.
Co-Authors Krisnawati, Vira Hari Sobri Abusini