Artificial intelligence method is very effective in solving the complex combinatorial problems.
人工智能方法是解决复杂组合问题的有效方法。
In order to solve more combinatorial problems, promote the concept grape to the hypergraph is a very natural thing.
为了解决更多的组合问题，把图的概念推广到超图是非常自然的事情。
Many problems in life science or bioinformatics can be translated into combinatorial problems of mathematics and computer science on sequences, trees and stings.
在生命科学中，许多问题都可以抽象为计算机科学与数学中关于序列、树和串的组合问题。
The purpose of this paper is to sum-up combinatorial auctions -model which based on particular auction market, to study the combinatorial problems from the Angle of commonly model.
本文的目的就是以具体拍卖市场为基础建立组合拍卖模型，从一般模型的角度研究组合拍卖问题。
Ant colony system is a novel simulated evolutionary algorithm, which provides a new method for complicated combinatorial optimization problems.
蚁群算法是一种新型的模拟进化算法，为求解复杂的组合优化问题提供了一种新的思路。
In this paper, the polynimial time algorithms of the NP complete problems are gained in the algebraical and combinatorial two aspects respectively.
本文从代数及组合两个方面论证了NP完全问题存在多项式时间算法。
An adaptive combinatorial optimization algorithm for solving this integrated optimization design problems is put forward.
针对一体化设计问题的求解要求提出了相应的组合优化算法。
The maximum flow problem is one of the classical combinatorial optimization problems.
最大流问题是一个经典的组合优化问题。
The assignment problem is a kind of combinatorial optimization problems.
分配问题是一个组合优化问题。
It can be applied to solve in many combinatorial optimization problems.
它能应用到求解许多组合优化问题。
Due to the high parallelism and recognition ability of the biomolecules in biochemical reactions, biomolecular computing behaves great advantage in solving combinatorial optimization problems.
由于生物分子在化学反应中具有高度的并行性和识别能力，使生物分子计算在解决组合优化问题中显示出巨大的优势。
Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.
分枝限界算法是一种求解组合优化问题的一般性方法，并行化是提高算法性能的有效手段。
Computation shows that the algorithm is efficient and can be used to solve the complicated combinatorial optimization problems such as machine scheduling.
计算表明，该算法具有较高的效率，能有效地求解机器排序等复杂的组合优化问题。
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大团问题是组合优化中的一个经典的NP -完全问题。
The Algorithm has very wide generality and very good efficiency, its basic principle can widely be used in solving large scale combinatorial optimization problems.
该算法通用性强，效率高，其基本原理可广泛应用于求解大规模的组合优化问题。
In network graph theory, combinatorial optimum problems, optimum design of network and other related theoretical problems are studied.
网络图论研究网络中的组合优化问题、网络的优化设计及与其相关的一些理论问题。
The problem of collecting and delivery shunting of non-through wagon flow on the actinoid private line belongs to a kind of the combinatorial optimization problems.
放射形专用线非直达车流取送车问题属于一类组合优化问题，影响因素较多。
The framework is given for solving combinatorial optimization problems with Line up Competition Algorithm (LCA), and the two principles of determining mutation neighbor region is presented.
给出了列队竞争算法解组合优化问题的框架和确定变异邻域的两条原则。
Job shop scheduling problem is one of the typical combinatorial optimization problems with constraints. To get its encoding has always been one of the main and difficult points of the problem.
车间作业调度问题是一类带有约束的典型的组合优化问题，目前采用人工鱼群算法解决车间作业调度问题没有检索到参考文献。
The research of the Parallel Immune Algorithm application will help to solve other combinatorial optimization problems.
并行免疫算法的应用研究将有助于其他组合优化问题的解决。
After lots of experiments ACO has exhibited its excellent performance and efficiency in experiments for solving a great lot of combinatorial optimization problems, and now it is used in many areas.
大量实验结果表明，它在解决许多组合优化问题时都能表现出较好的求解能力，目前此算法已经得到了比较广泛的应用。
Scheduling is one of the most important combinatorial optimization problems. It is very important in industrial production, manufacturing systems and other fields.
生产调度是一类重要的组合优化问题，在工业生产、制造系统等领域应用广泛。
Scheduling is an important combinatorial optimization problem. The modern scheduling problems that break through the various assumptions of the classical ones hold out more and more broad prospects.
排序问题是一类重要的组合优化问题，现代排序问题突破了经典排序问题的种种假设，有着越来越广阔的应用前景。
In order to solve NP - shop scheduling combinatorial optimization problems, an immune forgotten algorithm for job shop scheduling is proposed.
为了解决车间调度NP组合优化的难题，提出了基于免疫遗忘的车间调度算法。
The path optimization problem belongs to combinatorial optimization problems, which is solved generally by using heuristic search algorithm.
路径优化问题属于组合优化问题，而解决组合优化问题一般使用启发式搜索算法。
Aiming at combinatorial optimization problems, this paper carries out the following main research work based on EDA. A hybrid EDA is proposed to solve the multidimensional knapsack problems (MKP).
本文针对组合优化问题，基于分布估计算法主要开展了如下研究：针对多维背包问题，设计了一种混合分布估计算法。
The design of wireless telecommunications networks is a complex process, which requires solving simultaneously many difficult combinatorial optimization problems.
无线通讯网络的设计是一个复杂的过程，同时许多的困难的组合优化问题需要解决。
The design of wireless telecommunications networks is a complex process, which requires solving simultaneously many difficult combinatorial optimization problems.
无线通讯网络的设计是一个复杂的过程，同时许多的困难的组合优化问题需要解决。
应用推荐