查询词典 combinatorial optimization problem

All of the research results can be widely applied in various aspect of social practice, and provide a good research way and method for combinatorial optimization problem with parameter and inverse symmetric transportation problem, promote the research of network programming design, help to get farther research results, enrich the theory treasury of systems engineering.

这些研究成果可以广泛应用于社会实践的各个方面，并为含参数的组合优化问题的研究、组合优化问题的逆问题的研究提供了一个很好地研究思路和方法，推动了网络规划设计方法的研究工作，有助于取得进一步的研究成果，丰富系统工程理论宝库。

This problem can be modeled as a combinatorial optimization problem as follows.

这一问题可以归结为一个组合优化问题如下。

Scheduling problem is one important class of combinatorial optimization problem.

排序问题是一类重要的组合优化问题。

Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.

作业车间调度问题是一个典型的NP难问题，是最困难的组合优化问题之一。

Job Shop Scheduling Problem is a very hard combinatorial optimization problem and has great importance in engineering applications.

作业车间调度问题是一个非常复杂的组合优化问题，它在工程应用中有着十分重要的意义。

Ant Colony Optimization algorithm is a new heuristic algorithm to the combinatorial optimization problem.

蚁群算法是一种新兴的启发式算法。

The Hopfield neural network optimization algorithm is a new and potential approach for combinatorial optimization problem.

用反馈神经网络优化算法求解组合优化问题是一条崭新的、具有很大潜力的途径。

It is known that a production sequencing problem in mixed-model assembly line falls into NP-hard class of combinatorial optimization problem and thus a large-sized problem may be computationally intractable.

本文应用一种解大规模组合优化问题，特别是NP完全组合优化问题的有效近似算法——模拟退火算法，来求解混流生产线的投产排序问题，克服了上述缺点。

Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.

最大团问题是一个经典的NP难的组合优化问题，很多实际问题都可以抽象为对无向图上最大团问题的求解，所以，对最大团问题的研究无论在理论上还是实际上都有重要意义。

The traveling agent problem is a complex combinatorial optimization problem.Ant colony algorithm suits to solve nondeterministic polynomial problem,as it is a new evolutionary algorithm,has the characteristics of parallelism,positive feedback and heuristic search.

旅行Agent问题是复杂的组合优化问题，蚁群算法作为一种新的生物进化算法，具有并行、正反馈和启发式搜索等特点，适合求解NP难问题。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。