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