组合最优化

旅行售货员问题（TSP）是图论、组合最优化和计算机科学中所熟知的。

The traveling salesman problem ( TSP ) is celebrated in graph theory , combinatorial optimization and computer science .

分支-切割法可以用来解决许多组合最优化问题，特别是大规模问题，例如旅行商问题（TSP）。

Branch-and-cut methods can solve many combinatorial optimization problems , especially large scale problems , for instance , traveling salesman problem ( TSP ) .

投资组合最优化问题是一个NP难解问题，通常的方法很难使其达到全局最优。

Portfolio optimization problem is an NP problem , and it is very difficult to reach the global optimum in a common method .

ACO算法十分适合于求解组合最优化问题，已经被成功应用于很多领域。

It suitables to solve combination optimization problem , and has been applied in many fields successfully .

本文针对C-D生产函数参数估计中时常会出现负值弹性系数的情况，提出三种在取消对技术水平的假定条件下进行参数估计的组合最优化算法。

This paper presents three combinatorial optimization algorithms to eliminate the negative elasticities in parameter estimation of C-D production function .

求解TSP问题是遗传算法应用的一个重要领域，其本质是TSP问题中巡回路径编码串的组合最优化问题。

Solving Traveling Salesman Problem ( TSP ) is an important problem in Genetic Algorithm 's Application , it is an optimization problem of the TSP path encoding in essence .

矩形排样问题属于组合最优化问题和NP完全问题，因为存在计算上的复杂性，在一定时间内求其精确全局最优解是相当困难的。

Rectangular packing problem ( RPP ) is a combinatorial optimization and NP-complete problem . It is difficult to find its exact global optimum for such a problem because of the high complexity of computation .

S.Johnson在[3]中引入图灵归约的概念，利用这个概念把NP完全性理论推广到包括组合最优化问题在内的更广的一类问题上。

S. Johnson introduced the concept of Turing reduction and by using this concept intended to make the theory of NP-completeness applicable to an extended class of problems including the combinatorial optimal problems in [ 3 ] .

但是，CARI方法需要进行穷尽搜索以解决组合最优化问题，致使其复杂度随子块数的增加呈指数增长。

However , CARI scheme requires an exhaustive search to solve a difficult combinatorial optimization problem whose complexity grows exponentially with the number of subblocks .

本文介绍三个新的组合最优化模型，并分别给出复杂性为O（N2）和O（N2α）的多项式算法和拟多项式算法。

In this paper . we present three new models of combinatorial optimization problems . Furthermore , a polynomial algorithm to Model ⅰ and a quasi-polynomial algorithm to Model ⅱ are given , Their complexity are O ( N2 ) and O ( N2a ) respectively .

分布式关系数据库最优化查询是一个组合最优化问题。

Distributed relational database query optimisation is a combinatorial optimisation problem .

这是一种复杂的带性能约束的立体空间布局问题，在数学上可以归结为组合最优化。

It can be boiled down to combinatorial optimization problem in mathematics .

舍入法与某些组合最优化问题的求解

The Optimal Solutions to Some Combinatory Problems with Rounding-off Method

一类组合最优化问题及其算法

A Class of Special Combinatorial Optimization Problems and their Algorithms

应用组合最优化原理对熔池炼铜的精矿配料问题进行了研究。

Concentrate Burden has been studied by using the combination Optimization principle .

一种多目标组合最优化问题算法

An Approach to a Kind of Multi-objective Combination Optimization

布局问题是一个组合最优化问题。

Layout problem is a combinatory optimization problem .

考虑投资者主观预期的资产组合最优化

Asset Allocation Considering with Investor 's Subject Expectation

关于组合最优化理论的多媒体教学实践

On Teaching Multimedia of Combinatorial Optimization Theory

图的控制集问题是一类应用广泛的组合最优化问题。

The dominating set and partial dominating set problems are important combinatorial optimization problems in many applications .

给出了基于β风险域的投资组合最优化方法的应用例子。

An applicable example of investment portfolio optimization method based on β set is given in the paper .

基于均值-VaR的投资组合最优化

Mean-VaR Based Portfolio Optimization

图的最优标号是图论及组合最优化中涉及顺序结构的一个专题，由于得到应用领域的支持，并与其它理论课题发生密切联系，半个世纪以来受到众多学者的关注。

The optimal labeling problems for graphs is a special topic dealing with ordering structure in graph theory and combinatorial optimization .

机组排班问题是属于组合最优化的问题，在航空公司的运营控制中占有重要地位。

The shift arrangement problem belongs to the domain of combination optimization and plays an important role in airlines ' operating control .

因此，用谱风险量度度量金融市场风险并进行投资组合最优化问题既有实际意义，又有理论价值。

Thus , spectral risk measure of financial market risk measurement and portfolio optimization problem for both of practical and theoretical value .

本文讨论了在不完备市场定期交易的环境下，对企业直接投资的投资组合最优化问题。

This paper discusses the investment optimization problem under periodic trading system in incomplete markets , where the investors take companies as investments .

在求解大规模复杂组合最优化问题的应用中，遗传算法往往因为个体多样性不足存在早熟收敛倾向。

In the application to solving the complicated large-scale combination optimization prob-lems , GAs usually tend to converge prematurely because of the insufficient diversity of individuals .

本文研究发现我国A股市场数据的抽样误差非常显著，并且严重影响到组合最优化处理过程的有效性。

I find out that the sample error of using data from the Chinese stock market is so huge that it seriously influenced the portfolio optimization process .

蚁群算法是一种解决组合最优化问题的高效的启发式方法，但容易出现停滞和陷入局部最优。

Ant colony algorithm ( ACA ) is a highly efficient meta-heuristic method for solving combinatorial optimization problem . However , it is inclined to premature convergence problems .

这一正统理论的形成有着充分的理由：经济学家已取得了真正的科学突破，比如一般均衡理论、博弈理论、资产组合最优化模型和衍生品定价模型。

This orthodoxy has emerged for good reason : economists have made genuine scientific breakthroughs , such as general equilibrium theory , game theory , portfolio optimisation and derivatives pricing models .