Recommendations
- Scheduling Commercials on Broadcast Television
- The TV advertisements scheduling problem
- Scheduling Commercial Videotapes in Broadcast Television
- Conflict resolution in the scheduling of television commercials
- Scheduling advertising slots for television
- Network competition and the timing of commercials
- A branch and bound algorithm for optimal television commercial scheduling
- New formulations for the conflict resolution problem in the scheduling of television commercials
- Optimal television schedules in alternative competitive environments
Cites work
- A new polynomial-time algorithm for linear programming
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3423800 (Why is no real title available?)
- Reducibility among combinatorial problems
- The complexity of theorem-proving procedures
Cited in
(10)- A branch and bound algorithm for optimal television commercial scheduling
- Complexity analysis and algorithms for the program download problem
- New formulations for the conflict resolution problem in the scheduling of television commercials
- Conflict resolution in the scheduling of television commercials
- Scheduling advertising slots for television
- Scheduling Commercials on Broadcast Television
- The program download problem: complexity and algorithms
- Scheduling Commercial Videotapes in Broadcast Television
- Better hardness results for the minimum spanning tree congestion problem
- The TV-break packing problem
This page was built for publication: The complexity of scheduling TV commercials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923372)
