The tabu search (TS) method is one of the modern optimization algorithms developed from local search. It is generally used in combinatorial optimization problem.
TS算法属于现代优化算法，是局部领域搜索法的推广，常用于求解组合优化问题。
It is the combinatorial algorithms which based on a science of studying discrete objects, Combinatorics, that make people feel that computer may have its own thought.
组合数学是研究离散对象的科学，正因为有了以组合数学为基础的组合算法，才使人感到计算机好像是有思维的。
Ant system algorithm is a kind of evolutionary algorithms, which is efficient in solving combinatorial optimization problem.
蚁群算法是一种进化算法，适合解决组合优化问题，指派问题是组合优化问题中的一个分支。
However, the traditional algorithms have the problems of early convergence or stagnation in the process of combinatorial optimization problems.
然而，基本蚁群算法在求解组合优化问题过程中容易出现过早收敛或停滞现象。
The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches.
演讲重点在分支介绍现代组合优化技术和减少算法和拉格朗日算符松弛接近。
This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search.
本文提出了将组合问题归结为状态空间搜索问题的数学模型和通用算法。
The combinatorial games are much finer than game template in characterizing behavioral equivalences, and are much closer to the design of equivalence checking algorithms.
组合游戏的刻画方法比游戏模板更为细致，而且更加接近等价性检测算法的设计。
In order to solve the failure of the structural index reduction algorithms in a few cases, another algorithm which is called combinatorial relaxation algorithm is analyzed and studied.
为了解决算法少数情况下的失效问题，深入研究和分析了一种修正算法——组合松弛算法。
In order to solve the failure of the structural index reduction algorithms in a few cases, another algorithm which is called combinatorial relaxation algorithm is analyzed and studied.
为了解决算法少数情况下的失效问题，深入研究和分析了一种修正算法——组合松弛算法。
应用推荐