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.

Citation

Kolesar, Peter. "A remark on the computation of optimum media schedules." Operational Research Quarterly 19, no. 1 (March 1968): 73-75.

Each author name for a Columbia Business School faculty member is linked to a faculty research page, which lists additional publications by that faculty member.

Each topic is linked to an index of publications on that topic.