某些装箱问题是NP完全的,但可以通过动态规划法或近似最优的启发式解法来解决。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
它是按照某一优化指标规划出一条从起始状态到目标状态的最优或者近似最优的无碰路径。
It means to search an optimal or approximate optimal free path from start state to target state according to some optimize criterion.
由于在这样的环境中找到一个最优的调度是一个NP难问题,通常运用各种启发式算法来找到近似最优解。
Finding an optimal scheduling for such an environment is a NP-hard problem, and so heuristic approaches must be used in general to get an optimal approximation solution.
应用推荐