Branch-and-Cut algorithmsprovide a

Branch-and-Cut algorithms
provide a flexible platform to include many properties of
network design problems, and with smart exploitation of the problem
structure, finding stronger bounds and cuts, it is possible to
push the size limits and solve more realistic problems. Among
the metaheuristic algorithms, the family of Tabu search heuristics
was used most. This fact leaves a great opportunity to study other
families of metaheuristic algorithms, especially population-based
algorithms, and compare their performance. In addition, parallel
computing offers a capability to handle time and memory consuming
solution algorithms especially for large and decentralized planning
problems

Results (English) 2:

分支和切割算法
包括
网络设计问题的许多特性提供了一个灵活的平台，和问题的
结构智能开发，寻找更强的界限和削减，这是可能的
推大小限制和解决更多的实际问题。
之间的元启发式算法，禁忌搜索算法
家庭是最常用的。这一事实的叶子的启发式算法的研究等
家庭一个很好的机会，尤其是以人群为基础的
算法，并比较它们的性能。此外，并行
计算提供了一种能够处理时间和内存消耗
算法特别是大型的、分散的规划
问题