CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM
In this research paper, we shall consider the application of classical 0-1 knapsack problem with a single constraint to selection of television advertisements at critical periods such as prime time news, news adjacencies, break in news and peak times using the WINQSB software. In the end of this pap...
Main Authors: | E. Ivokhin, Almodars Barraq Subhi Kaml |
---|---|
Format: | Article |
Language: | deu |
Published: |
Publishing Center "Kyiv University"
2014-06-01
|
Series: | Вісник Київського національного університету імені Тараса Шевченка. Серія Економіка |
Subjects: | |
Online Access: | http://bulletin-econom.univ.kiev.ua/wp-content/plugins/download-attachments/includes/download.php?id=1688 |
Similar Items
-
A hybrid guided neighborhood search for the disjunctively constrained knapsack problem
by: Mhand Hifi, et al.
Published: (2015-12-01) -
Comparison of Dynamic Programming Algorithm and Greedy Algorithm on Integer Knapsack Problem in Freight Transportation
by: Global Ilham Sampurno, et al.
Published: (2018-05-01) -
Knapsack Problem Solution based on Knapsack Packing Tree Search
by: Mikhail Andreevich Kupriyashin, et al.
Published: (2014-02-01) -
Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization
by: Viska Dewi Fawzy, et al.
Published: (2017-12-01) -
Evolution of Knapsack Ciphersystems
by: Georgii Ivanovich Borzunov, et al.
Published: (2015-03-01)