Pages that link to "Item:Q1733325"
From MaRDI portal
The following pages link to The TV advertisements scheduling problem (Q1733325):
Displaying 10 items.
- A branch and bound algorithm for optimal television commercial scheduling (Q2086864) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
- New formulations for the conflict resolution problem in the scheduling of television commercials (Q2830761) (← links)
- Scheduling advertising slots for television (Q3612202) (← links)
- The complexity of scheduling TV commercials (Q4923372) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Non‐dominated “trade‐off” solutions in television scheduling optimization (Q5257897) (← links)
- Sales plan generation problem on TV broadcasting (Q5273176) (← links)
- On the local dominance properties in single machine scheduling problems (Q6588484) (← links)