Pages that link to "Item:Q1733325"
From MaRDI portal
The following pages link to The TV advertisements scheduling problem (Q1733325):
Displaying 4 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)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
