THE BRANCH AND BOUND APPROACH TO A BOUNDED KNAPSACK PROBLEM (CASE STUDY: OPTIMIZING OF PENCAK SILAT MATCH SESSIONS)
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 maxi...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Pattimura
2024-10-01
|
| Series: | Barekeng |
| Subjects: | |
| Online Access: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/12883 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|