Multi choice knapsack problem, Case Study in Optimal Television Adverts Selection | ||
| AL-dananeer | ||
| Article 1, Volume 1, Issue 5, May 2018, Pages 352-373 | ||
| Authors | ||
| Assistant ProfessorDr.E.V.Ivokhin; Assistant Lecturer | ||
| Abstract | ||
| Knapsack problems have been intensively studies since the pioneering work of Dantzing [3] in the late 50’s, both because of their immediate applications in industry and financial management, but more pronounced for theoretical reasons, as Knapsack problems frequently occur by relaxation of various integer programming problems. In such applications, we need to solve a Knapsack problems each time a bounding function is derived demanding extremely fast solution techniques. The family of Knapsack problems all require a subset of some given items to chosen such that the corresponding profit sum is maximizing without exceeding the capacity of the knapsack(s). In the 0-1 Knapsack problems each item may be chosen at most once, while. The multi-choice Knapsack problems occur when the items should be chosen from disjoint classes. Sinha and Zoltners [4] proposed to use multi-choice Knapsack problems to select which components should be linked in series in order to maximizing fault tolerance. | ||
| Keywords | ||
| Multi choice; Case Study | ||
|
Statistics Article View: 87 PDF Download: 18 |
||