查询词典 combinatorial optimization problem

Quadratic Assignment Problem is one of the classical combinatorial optimization problems and is known for its diverse applications.

QAP问题是经典的组合优化问题之一，广泛应用于许多领域中。

The assignment problem is one of combinatorial optimization problems. simulated annealing algorithm can be used to solve assignment problem.

指派问题是组合优化问题中的一种，可用模拟退火算法来解此问题。

Uadratic Assignment Problem is one of the classical combinatorial optimization problems and is known for its diverse applications.

AP问题是经典的组合优化问题之一，广泛应用于许多领域中。

Cross Entropy method has recently been proposed as a heuristic method.It shows some simple performance in the process of solving combinatorial optimization problems.This paper makes full use of Cross Entropy method to obtain the best estimator for the max-cut problem which is a standard NP-hard problem in graph graphic theory.

交叉熵方法是近几年发展而来的一种启发式方法，在求解组合优化问题中显示出其简单有效的特点，将运用交叉熵方法寻求图论中一个典型的NP困难问题—最大割问题的最优解。

The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.

最大团问题是组合优化中的一个经典的NP-完全问题。

Vehicle routing problem with time windows is a NP-hard problem in combinatorial optimization field.

有时间窗的车辆路径问题属于组合优化领域中的NP-hard问题。

It is formulated as a multi-objective combinatorial optimization problem.

通过分析，将该问题归结为一个多目标组合优化问题。

Analyzed the similarity between scheme solving problem and traveling salesman problem, the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization, where the dynamic programming based solution space model and the longest path based optimization model are developed.

摘要通过分析概念设计方案求解问题与旅行商问题的相似性，将方案求解问题转化为组合优化的最优路径问题，建立了基于动态规划的解空间模型和基于最长路径的优化模型。

Shortest path problem is a basic problem in the combinatorial optimization. The objective in the network is time-varying.

在组合优化过程中，往往需要获得从起点到终点之间的最短路，而其所考虑的目标可能是一个与时间相关的变量。

The formulation of OYOD transformer s phase sequence adjustment is a combinatorial optimization problem with non-linear and non-differential objective function.

针对OYOD变压器相序调整是一个组合非线性及不能微分目标函数的最优化问题，提出用蚁群算法来求解OYOD变压器的相序调整问题，以提高负载平衡能力，同时提出一种变信息素挥发系数的方法以提高算法解的质量和收敛速度。

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.

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