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

doi:10.30598/barekengvol18iss4pp2449-2458

Open access Jurnal SINTA 3

THE BRANCH AND BOUND APPROACH TO A BOUNDED KNAPSACK PROBLEM (CASE STUDY: OPTIMIZING OF PENCAK SILAT MATCH SESSIONS)

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 4 (2024) · pp. 2449–2458

DOI: 10.30598/barekengvol18iss4pp2449-2458
ISSN: 2615-3017, 1978-7227
Published: 2024-10-11
Publisher: PATTIMURA UNIVERSITY
Language: eng
License: creativecommons.org/licenses/by-sa/4.0

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.

Collaboration network of the authors

10 authors · 16 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

Affiliation unknown

Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles

Show as table

Co-author	Organisation	Joint articles
Noor Hidayat	Affiliation unknown	2
Desfi Rahmatul Khairi	Affiliation unknown	2
Hafizha Nur Laily	Affiliation unknown	1
Umu Sa’adah	Affiliation unknown	1
Ni Kadek Emik Sapitri	Affiliation unknown	1
Ardi Nur Hidayat	Affiliation unknown	1
Abdul Rouf Alghofari	Affiliation unknown	1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.

Original metadata (oai_dc)

<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">THE BRANCH AND BOUND APPROACH TO A BOUNDED KNAPSACK PROBLEM (CASE STUDY: OPTIMIZING OF PENCAK SILAT MATCH SESSIONS)</dc:title>
	<dc:creator>Ambarwati, Aditya</dc:creator>
	<dc:creator>Abusini, Sobri</dc:creator>
	<dc:creator>Krisnawati, Vira Hari</dc:creator>
	<dc:description xml:lang="en-US">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.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/12883</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss4pp2449-2458</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 4 (2024): BAREKENG: Journal of Mathematics and Its Application; 2449-2458</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss4year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/12883/8905</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Aditya Ambarwati, Sobri Abusini, Vira Hari Krisnawati</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>