We use Lagrangian Relaxation which is based on a scheme named Compath Decomposition to dualize the capacity constraints.

本文用基于路分拉格朗日分算法求模型，把容量约束松弛后得路分法主问题和子问题。

We use Lagrangian Relaxation which is based on a scheme named Compath Decomposition to dualize the capacity constraints.

本文用基于复合路分解的拉格朗日分解算法求解模型，把容量约束松弛后得到复合路分解法的主问题和子问题。

We use Lagrangian Relaxation which is based on a scheme named Compath Decomposition to dualize the capacity constraints.

本文用基于复合路分的拉格朗日分算法求，把容量约束松弛后得到复合路分法的主问题和子问题。

We use Lagrangian Relaxation which is based on a scheme named Compath Decomposition to dualize the capacity constraints.

本文用基于复合路分解的拉格朗日分解算法求解，容量约束松弛后得到复合路分解法的主问题和子问题。

We use Lagrangian Relaxation which is based on a scheme named Compath Decomposition to dualize the capacity constraints.

本文用基于复合路解的拉格解算法求解模型，把容量约束松弛后得到复合路解法的主问题和子问题。

We use Lagrangian Relaxation which is based on a scheme named Compath Decomposition to dualize the capacity constraints.

本文用基于复合路分解朗日分解算法求解模型，把容量约束松弛后得到复合路分解法主问题和子问题。

We use Lagrangian Relaxation which is based on a scheme named Compath Decomposition to dualize the capacity constraints.

本文用基于复合路的拉格朗日法求模型，把容量约束松弛后得到复合路法的主问题和子问题。

We use Lagrangian Relaxation which is based on a scheme named Compath Decomposition to dualize the capacity constraints.

本文用基路分解的拉格朗日分解算法求解模型，把容量约束松弛后得到路分解法的主问题和子问题。

We use Lagrangian Relaxation which is based on a scheme named Compath Decomposition to dualize the capacity constraints.

本文用基于复合路分的拉格朗日分算法模型，把容量约束松弛后得到复合路分法的主问题和子问题。