Otherwise, the hybrid algorithm can avoid trapping in local optimum and does not need initial feasible solution.
另外，该算法可有效避免陷入局部最优，也不要求提供初始可行解。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
应用推荐