In this algorithm, a subproblem is set up to search for a new feasible point at which the value of the objective function is lower than the current local minimum.
该算法通过构造子问题来寻找优于当前局部最优解的可行解。
In this algorithm, a subproblem is set up to search for a new feasible point at which the value of the objective function is lower than the current local minimum.
该算法通过构造子问题来寻找优于当前局部最优解的可行解。
应用推荐