查询词典 combinatorial problem

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 vehicle scheduling problem is the very core of the content in the logistics scopes, it is a typical NP-hard problem, involving in many research subjects such as operations research, applied mathematics, combinatorial optimization, network analysis, computer software, computer applications, logistics science, transportation management, etc.

车辆优化调度问题(Vehicle Scheduling Problem，简称VSP)是物流配送中的最为核心的内容，它是一个典型的NP难题，涉及到运筹学、应用数学，组合优化、图论与网络分析、计算机软件、计算机应用、物流科学、运输管理等众多学科领域。

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.

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

In the optimization problem, the more common is combinatorial optimization problem.

在优化问题中，比较常见的是组合优化问题。

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.

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

First, the original problem is changed into a class of combinatorial optimization problem.

将结构优化问题转化为一类组合优化问题。

The transportation problem is well known as a combinatorial optimization problem for it could be extensively applied in many fields.

运输问题自提出后，人们因其在各个领域的广泛应用进行了大量研究。

Effective local search tactics reaches local searchers when they are ready to buy - with every way that it is possible for them to buy from you.

有效的地方搜索策略达到当地的搜索，当他们准备购买-以各种方式，这是他们有可能从您那里进行购买。

The first two are periodic sentences for their beginnings; and the fifth and the last are also periodic sentences each for the embedding of a parenthetic structure.

1960年代中后期，当战后女权主义和当时的许多其他抗议运动在西欧和北美发展成某种势力时，性别的概念演绎成补充和延伸生物性别差异的概念。