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

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