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...
Saved in:
| Main Authors: | E. Ivokhin, Almodars Barraq Subhi Kaml |
|---|---|
| Format: | Article |
| Language: | deu |
| Published: |
Taras Shevchenko National University of Kyiv
2014-06-01
|
| Series: | Вісник Київського національного університету імені Тараса Шевченка. Серія Економіка |
| Subjects: | |
| Online Access: | http://bulletin-econom.univ.kiev.ua/wp-content/plugins/download-attachments/includes/download.php?id=1688 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
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) -
Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications
by: Tibor Szkaliczki
Published: (2025-03-01) -
Machine Learning-Driven Optimization for Solution Space Reduction in the Quadratic Multiple Knapsack Problem
by: Diego Yanez-Oyarce, et al.
Published: (2025-01-01) -
ANALYSIS AND IMPLEMENTATION OF A CRYPTOSYSTEM BASED ON NON-INJECTIVE KNAPSACKS
by: Maria Sabina A. Volkov
Published: (2025-07-01) -
Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem
by: Ruqaya Sha’ban, et al.
Published: (2018-12-01)