initial feasible solution

基本解释

The initial feasible solution can be used in the elicitation algorithm to solve the Traveling Salesman Problem(TSP).
在用启发式算法解决旅行推销员问题时要用到初始可行解。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
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算法该算法是基于迭代的方法，每次迭代包含两个阶段：构建初始可行解阶段和邻域搜索阶段。