Abstract
The media scheduling problem of Ellis is transformed into an integer linear programming problem in zero-one variables. The transformed problem is recognized as the knapsack problem and exact and approximate algorithms are proposed.
Full Citation
Operational Research Quarterly
vol.
19
,
(March 01, 1968):
73
-75
.