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.
本文用基于复合路径解的拉格解算法求解模型，把容量约束松后得到复合路径解法的主问问。
声明：以上例句、词性
类均由互联网资源自动生成，部未经过人工审核，其表达内容亦不代表本软件的观点；若发现问
，欢迎向我们指正。
