DCMST_on_GRASP AlgorithmThe algorithm is an iterative method which includes two phases in every iteration, namely, construction of an initial feasible solution phase and the local search phase.
GRASP算法该算法是基于迭代的方法,每次迭代包含两个阶段:构建初始可行解阶段和邻域搜索阶段。
The theoretical analysis and computational examples show that the initial feasible solution obtained by the method is satisfactory, which can provide good bounds in branch and bound procedures.
理论上的分析和计算的例子表明用这种方法得到的初始可行解是令人满意的,嵌入分支定界法可以提供好的界。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。