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

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