This article proposes a new heuristic algorithm for capacitated P-median problem.

针对约束p -中位问题的特点，提出了一种新的启发式算法。

The Capacitated Plant Location Problem (CPLP) is a NP problem and hard to get an optimal and satisfactory solution.

容量受限的工厂选址问题属于NP难题，较难得到最优解和满意解。

The complexity of the 2 -opt algorithm for the capacitated vehicle routing problem (CVRP) was analyzed in this paper.

分析了需求不可分割带能力约束的车辆路径问题(cvrp)的2 - OPT算法计算时间的平均复杂度。

The Newton method with the new gradient is combined with the interior penalty method to obtain the capacitated network flow solution.

利用新梯度的特征，并结合惩罚函数方法，可以获得容量制约下的交通网络流的解。

The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.

研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。