Solution of Multiple Constraints Knapsack Problem (MCKP) by Using Branch and Bound Method and Greedy Algorithm (Plagiarism)
| Main Authors: | Irmeilyana, Irmeilyana, Bangun, Putra Bahtera Jaya, Izzah, Hazrati |
|---|---|
| Format: | Lainnya NonPeerReviewed Book |
| Bahasa: | eng |
| Terbitan: |
SREE
|
| Subjects: | |
| Online Access: |
http://repository.unsri.ac.id/22724/1/9.Solution%20of%20Multiple%20Constraints%20Knapsack%20Problem%20%28MCKP%29%20by%20Using%20Branch%20and%20Bound%20Method%20and%20Greedy%20Algorithm.pdf http://repository.unsri.ac.id/22724/ http://www.sree.org.uk/jmo/9.2/jmo.9.2.112.pdf |
Daftar Isi:
- 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.