Solution of Multiple Constraints Knapsack Problem (MCKP) by Using Branch and Bound Method and Greedy Algorithm (CORRESPONDING AUTHOR)

Irmeilyana, Irmeilyana and Bangun, Putra Bahtera Jaya and Hazrati, Izzah Solution of Multiple Constraints Knapsack Problem (MCKP) by Using Branch and Bound Method and Greedy Algorithm (CORRESPONDING AUTHOR). scree.org.

[thumbnail of Korespondensi-Solution of Multiple-JMO-2017.pdf]
Preview
Text
Korespondensi-Solution of Multiple-JMO-2017.pdf

Download (555kB) | Preview
Item Type: Other
Subjects: #3 Repository of Lecturer Academic Credit Systems (TPAK) > Corresponding Author
Divisions: 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User: Mrs Irmeiliana Irmeiliana
Date Deposited: 16 Jun 2022 00:24
Last Modified: 16 Jun 2022 00:24
URI: http://repository.unsri.ac.id/id/eprint/72350

Actions (login required)

View Item View Item