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

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