This is a combinatorial problem in canonical form.
这是组合论中的典型问题。
It can easily be modified for any combinatorial problem for which we have no good specialized algorithm.
对于目前还没有好的解法的组合优化问题，很容易地修改此算法就可解决。
Sudoku is a popular combinatorial problem in recent five years, while it just begins to study it in China.
数独是近五年来国际上最热门的组合问题之一，国内研究才刚开始。
This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search.
本文提出了将组合问题归结为状态空间搜索问题的数学模型和通用算法。
However, clustering is a difficult and combinatorial problem, and different request in different communities has made the transfer of useful generic concepts and methodologies slow to occur.
然而，聚类是一个综合性的难题，且不同领域的不同要求使得有用的概念及方法的产生非常缓慢。
The pigeonhole principle is a powerful tool used in combinatorial math. But the idea is simple and can be explained by the following peculiar problem.
鸽子洞原理是分析数学组合的有力工具。但是其概念简单，可以通过以下具体的问题加以阐述。
It is a typical combinatorial optimization problem.
它是典型的组合优化问题。
Ant Colony algorithm is a novel simulated evolvement algorithm solving complicated combinatorial optimization problem and its typical feature is swarm intelligence.
蚁群算法是一种新颖的求解复杂组合优化问题的模拟进化算法，它具有典型的群体智能的特性。
Distribution Network Structure planning is a complex combinatorial optimization problem, which is difficult to solve properly by using traditional optimization methods.
配电网网架规划是一个复杂的组合优化问题，传统的优化方法往往难以解决此类问题。
The integrated design of cellular manufacturing system (CMS) is a combinatorial optimization problem.
单元制造系统的集成设计问题是一个组合优化问题。
Optimal placement of switch device is a combinatorial optimization problem with reliability cost objective function.
分段开关优化配置是一种以可靠性费用最小为目标函数的组合优化问题。
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算法属于现代优化算法，是局部领域搜索法的推广，常用于求解组合优化问题。
The maximum flow problem is one of the classical combinatorial optimization problems.
最大流问题是一个经典的组合优化问题。
The scheduling of logistic processes is a combinatorial optimization problem.
物流过程的调度是一个组合优化问题。
The assignment problem is a kind of combinatorial optimization problems.
分配问题是一个组合优化问题。
The ant algorithm is a class of population based bionic algorithm, which provides new methods for complex combinatorial optimization problem.
蚁群算法是基于群体的一种仿生算法，为求解复杂的组合优化方法问题提供了一种新思路。
This is a multifactor optimization decision question, and it is a typical problem in combinatorial optimization.
这是一个多因素的优化决策问题，是组合规划中的典型问题。
The maximum flow problem is a classical combinatorial optimization problem.
最大流问题是一类经典的组合优化问题。
Network reconfiguration is a multi-objective nonlinear combinatorial optimization problem.
网络重构是一个多目标非线性组合优化问题。
The properties of the joint probabilistic data association(JPDA)are analyzed, and data association is reduced to a sort of constraint combinatorial optimization problem.
通过对多目标联合概率数据关联方法性能特征的分析，将其归结为一类约束组合优化问题。
Redundancy allocation is a combinatorial optimization problem of system design.
冗余分配是系统设计中的组合优化问题。
Full Load Pickup and Delivery Problem(FLPDP) is an important combinatorial optimization problem existed extensively in the transportation domain.
满载装卸货问题是广泛存在于物流运输领域的重要组合优化难题。
In the optimization problem, the more common is combinatorial optimization problem.
在优化问题中，比较常见的是组合优化问题。
Optimal multistage transmission system expansion planning is a large-scale nonlinear combinatorial optimization problem.
多阶段输电系统规划问题是一个复杂的非线性组合优化问题。
Layout problem is an important offshoot of Operation Research; it belongs to complex combinatorial optimization problem.
布局问题是运筹学的一个重要分支，属于复杂的组合优化问题。
Three dimension packing problem with multi constraints is a complicated combinatorial optimization, and is NP HARD problem. It is difficult to obtain on optimal solution.
多约束条件下的三维装箱问题是一个复杂的组合优化问题，属于NP-HARD问题，其求解是很困难的。
Ant colony algorithm is a novel simulated evolutionary algorithm based on group cooperation and can be applied to solve hard discrete combinatorial optimization problem.
蚁群算法是基于群体合作的一类仿生算法，适合于解困难的离散组合优化问题。
The optimal layout for rectangular part is a NP-complete combinatorial optimization problem.
矩形件优化排料是一类具有NP完全难度的组合优化问题。
It is difficult to solve in large scale because the LRP is a typical NP-hard problem in combinatorial optimization.
由于定位-车辆路线问题是组合优化问题中一个典型的NP难题，大规模时难以精确求解。
It is difficult to solve in large scale because the LRP is a typical NP-hard problem in combinatorial optimization.
由于定位-车辆路线问题是组合优化问题中一个典型的NP难题，大规模时难以精确求解。
应用推荐