Knapsack problem greedy algorithm efficiency requirements in accordance with the unit value of the capacity measure of the level of sort, and then select the grade, get the optimal solution.
基于1个网页-相关网页
After a limited number of iterations, we can get the optimal solution of the primal problem.
在经过有限次迭代之后,可以求得原问题的最优解。
The problem is changed to solving the linear inequality group with two unknown, thus, we can get the optimal solution by the computer.
从而使问题转化成求解二元线性不等式组的问题,为此可方便地借助计算机求出最佳结果。
The notion here is that you can get a globally optimal solution from locally optimal solutions to sub-problems.
这里的概念是你可以通过,子问题的局部最优方案,得到全局优化解决方案。
应用推荐