组合优化

最大独立集问题（MaximumIndependentSetproblem，MIS）是图论中经典的组合优化问题。

The maximum independent set problem is a classical problem in combinatorial optimization .

DNA计算的粘贴模型及在组合优化中的应用

The stickers model of DNA computing and its application in combinatorial optimization

组合优化中的DNA计算

DNA Computing in Combination and Optimization

遗传算法（GA）适于求解复杂组合优化问题及非线性函数优化。

GA ( Genetic Algorithm ) is fit for solving complicated combination optimization and nonlinear function optimization .

TSP是经典的组合优化问题。

The TSP is a classic combinatorial optimization problem .

特征统计算法及其在NP组合优化问题上的应用

Characteristic Statistic Algorithm ( CSA ) and Its Application to NP Combined Optimization Problems

基于分位数的VaR（风险价值）不具有一致性，可能误导投资组合优化和风险管理，ES（预期短缺）测度克服了这一缺点。

Quantile-based VaR is not coherent and may be misleading in portfolio investment and risk management .

装箱问题是一个传统的NP难问题，它也是一个经典的组合优化问题。

The packing problem is a traditional NP-hard problem , it is a classic combinatorial optimization problem .

到目前为止，也很少用于解决离散的组合优化问题（COP）。

So far , it has rarely been used to discrete Combinatory Optimization Problems ( COP ) .

因此，建立了货位配置优化问题的数学模型，提出了采用Pareto遗传算法解决多目标组合优化问题，可得到Pareto最优解集。

A mathematic model is built to describe the problem of the freight sites assignment optimization .

所得到的结果表明，特征统计算法可以作为解决这类NP组合优化问题的一个新的途径。

It is proved that CSA can be a new method for solving these NP combined optimization problems .

由于定位-车辆路线问题是组合优化问题中一个典型的NP难题，大规模时难以精确求解。

It is difficult to solve in large scale because the LRP is a typical NP-hard problem in combinatorial optimization .

多用户检测（MUD）问题可以看作一个组合优化问题，因此可将智能计算的优化机理应用于多用户检测的寻优过程中。

Multiuser detection ( MUD ) problem can be viewed as a combinational optimization problem . Intelligence computation has shown many advantages over conventional optimization algorithm .

针对服务组合优化问题，提出了一个基于帕累托（Pareto）占优机制的多目标人工蜂群算法。

Artificial bee colony algorithm based on Pareto dominant mechanism is proposed for solving the service composition optimization problem .

遗传算法（GA）是近年来发展起来的强有力全局搜索工具，特别适合于求解复杂组合优化问题及非线性函数优化。

GA is a powerful global search tool that develops in recent years . It fits for resolving complicated combination optimization and nonlinear function optimization .

作为一个具有代表性的组合优化问题，旅行推销商问题（TSP）一直是众多学者的研究对象。

The Traveling Salesman Problem ( TSP ) is a representative combinatorial optimization problem and has been researched by numerous researchers .

最初的蚁群算法为解决旅行商问题（TSP）而提出，并在各种离散组合优化问题中展现出良好的获取解的能力，随后逐渐应用到连续优化问题领域中，有着广阔的应用前景。

It was first proposed for solving Traveling Salesman Problem , and exhibited it good ability in solving other combinatorial problem .

本文提出了基于传递闭合图（TransitiveClosureGraph）的测试调度表示法，该表示法符合P-admissible准则，使组合优化算法适用于SoC测试调度问题。

A novel description of test schedule based on transitive closure graph is proposed in this paper , and it is suitable for combinational optimization .

美国SDG公司的资产组合优化战略及管理

Capital optimizing strategy and management of American SDG company

随机算法在组合优化问题中具有广泛的应用，LasVegas算法和MonteCarlo算法是主要的两类随机算法。

Randomized algorithm is widely used in combinatorial optimization . Las Vegas algorithm and Monte Carlo algorithm are two important types of randomized algorithm .

基坑潜在隆起破裂面的Dijkstra组合优化搜索法

Study on composite optimization based on Dijkstra algorithm in searching potential bulge fracture plane of foundation pit

SIMO信道组合优化递推序列检测算法

A Recursive Approach of Combined Optimization to Sequence Detection of SIMO Channels

这种计算模式凭借着DNA序列的强大存储密度和高度并行性，在求解一些复杂的组合优化问题及NP困难问题时显示出了极大的优势。

By virtue of high-density storage and massive parallelism in DNA sequences , the calculation model has showed a great advantage in solving complex combinatorial optimization problems and NP hard problems .

首次提出了将遗传算法（GA）和变尺度法（DFP）相结合的电子光学系统设计的组合优化方法。

A new optimal design method of an electron-optical system combined genetic algorithm ( GA ) with variable scale method is described .

为解决QoS路由算法容易陷入局部最优的问题，将模拟退火方法与路由计算结合起来，提出一种新的组合优化算法。

Taking into account the local optimization of some QoS routing algorithms , this paper introduced a new combinatorial optimization algorithm , which combines the simulated annealing and k-shortest path algorithm .

TSP问题是一个经典的NP难度的组合优化问题，遗传算法是求解TSP问题的有效方法之一。

TSP ( Traveling Salesman Problem ) is a typical NP-hard problem in combinatorial optimization and Genetic Algorithm is one of methods for solving TSP .

混凝土搅拌站的选址问题（theallocationproblemoftheconcretemixingplants，以下简称APCMP）属于组合优化问题，随着我国建筑业的迅速发展，近年来越来越表现出其重要的实际意义。

The allocation problem of the concrete mixing plants ( APCMP ) belongs to the combinatorial optimization problem , it shows the more important practical significance with the rapid development of the construction industry .

TS算法属于现代优化算法，是局部领域搜索法的推广，常用于求解组合优化问题。

The tabu search ( TS ) method is one of the modern optimization algorithms developed from local search . It is generally used in combinatorial optimization problem .

当前大多数的IC作业调度都是基于组合优化技术的，与以往这些工作不同，本文提出了一种新的基于流水线的调度方案。

Most of the current IC job schedulers base on the technique of combinatorial optimization . Unlike these works , the paper presents a new way that treats an IC fab as a process pipeline .

首先介绍了遗传算法的理论和它在组合优化问题中的应用，然后针对基于遗传算法的TSP问题求解，在原有遗传算法的基础上提出了一种改进的混合遗传算法。

First , The introduction on GA 's theory and its applications on combination optimization are given . An improved hybrid genetic algorithm is then presented for TSP problem .