动态规划在货物归并问题中的应用及优化

以动态规划方法解决货物归并问题为例，阐述如何进行动态规划算法的分析设计，并在此基础上利用四边形不等式，减少动态规划过程中每一阶段的状态转移数，从而整体上降低动态规划的时间复杂度，使其能够适用于更大规模计算．这种优化方法具有通用性，对于状态转移方程与之类似且能满足四边形不等式的动态规划问题，都可以采用相同的优化方法进行优化．

Dynamic Programming in Cargo Heap Combination Question Application and Optimization

This paper proposes how dynamic programming algorithm works when it is used into cargo heap combination. This algorithm can be praetieal to the bigger scale computation, because it uses the quadrangle inequality to reduce not only shift numbers in all stages of dynamie programming process but also the complexity of time order in the whole. High versatility property enables it to solve all condition shift equations which belong to the dynamic programming of quadrangle inequality, if these condition shift equations are similar to the ways of application.