Pages that link to "Item:Q3100410"
From MaRDI portal
The following pages link to Conflict Resolution in the Scheduling of Television Commercials (Q3100410):
Displaying 14 items.
- The TV-break packing problem (Q853012) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- Optimal television schedules in alternative competitive environments (Q1291675) (← links)
- The TV advertisements scheduling problem (Q1733325) (← links)
- A branch and bound algorithm for optimal television commercial scheduling (Q2086864) (← links)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- New formulations for the conflict resolution problem in the scheduling of television commercials (Q2830761) (← links)
- Scheduling advertising slots for television (Q3612202) (← links)
- Scheduling Commercials on Broadcast Television (Q3637430) (← links)
- The complexity of scheduling TV commercials (Q4923372) (← links)
- Sales plan generation problem on TV broadcasting (Q5273176) (← links)
- Scheduling Commercial Videotapes in Broadcast Television (Q5321987) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)