动态规划
数学优化
计算机科学
预处理器
调度(生产过程)
有界函数
算法
数学
人工智能
数学分析
作者
María García de la Banda,Peter J. Stuckey,Geoffrey Chu
标识
DOI:10.1287/ijoc.1090.0378
摘要
We give a dynamic programming solution to the problem of scheduling scenes to minimize the cost of the talent. Starting from a basic dynamic program, we show a number of ways to improve the dynamic programming solution by preprocessing and restricting the search. We show how by considering a bounded version of the problem, and determining lower and upper bounds, we can improve the search. We then show how ordering the scenes from both ends can drastically reduce the search space. The final dynamic programming solution is orders of magnitude faster than competing approaches and finds optimal solutions to larger problems than were considered previously.
科研通智能强力驱动
Strongly Powered by AbleSci AI