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

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