Pages that link to "Item:Q2899107"
From MaRDI portal
The following pages link to Solving talent scheduling with dynamic programming (Q2899107):
Displaying 8 items.
- An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← links)
- Optimization in dubbing scheduling (Q889105) (← links)
- Optimal scheduling in film production to minimize talent hold cost (Q1321428) (← links)
- Dominance breaking constraints (Q2342647) (← links)
- Talent hold cost minimization in film production (Q2358484) (← links)
- A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling (Q2830948) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- Automatic generation of dominance breaking nogoods for a class of constraint optimization problems (Q6080646) (← links)