Irmeilyana, Irmeilyana and Bangun, Putra Bahtera Jaya and Izzah, Hazrati Solution of Multiple Constraints Knapsack Problem (MCKP) by Using Branch and Bound Method and Greedy Algorithm (Peer Review). SREE.
Preview |
Text
9.12-bambang.pdf Download (437kB) | Preview |
Preview |
Text
9.12-putra.pdf Download (425kB) | Preview |
Abstract
In this research, we analyze the steps to solve MCKP by combining the constraints into a 0-1 knapsack problem. The purpose of this research was also comparing the solution of MCKP model by using the data research of Prasetyowati & Wicaksana (2013) in selection of promotion media at UMN. The constraints to get the audiences interest consist of limited cost, limited time, and limited workers. Furthermore, in this research, the chosen promotion media is done by using Branch and Bound (BB) method and Greedy algorithm. By using BB method, the optimal audience for newspaper media is gained through Kompas. While for online media, the optimal audience is gained by Facebook and Youtube. The optimal audience for newspaper media is gained by Greedy by Profit, Greedy by Weight, and Greedy by Density algorithms consecutively Kompas, Jawa Pos, and Suara Merdeka. While for online media, the optimal audience is gained by Greedy by Profit, Greedy by Weight, and Greedy by Density algorithms consecutively through Facebook and Youtube, Youtube, Google and Facebook. The final result of BB method and Greedy by Profit algorithm for newspaper media are the same as dynamic programming. While the result of BB method and Greedy by Density algorithm for online media are the same as dynamic programming.
| Item Type: | Other |
|---|---|
| Uncontrolled Keywords: | knapsack, Multiple Constraints Knapsack Problem (MCKP), Branch and Bound Method, Greedy Algorithm |
| Subjects: | |
| Divisions: | 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1) |
| Depositing User: | Mrs Irmeiliana Irmeiliana |
| Date Deposited: | 01 Jan 2020 09:05 |
| Last Modified: | 01 Jan 2020 09:05 |
| URI: | http://repository.unsri.ac.id/id/eprint/22725 |
Available Versions of this Item
- Solution of Multiple Constraints Knapsack Problem (MCKP) by Using Branch and Bound Method and Greedy Algorithm (Peer Review). (deposited 01 Jan 2020 09:05) [Currently Displayed]
Actions (login required)
 |
View Item |