基于求解该模型的复杂性，进而提出了相应的两种启发式解法。
Based on the complexity of solving the model, two heuristic algorithm is proposed accordingly.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
应用推荐