查询词典 combinatorial optimization problem

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难题，涉及到运筹学、应用数学，组合优化、图论与网络分析、计算机软件、计算机应用、物流科学、运输管理等众多学科领域。

The maximum clique problem is a classical combinatorial optimization problem, and finds many important applications in different domains, this paper surveys the current progress on MCP. The Cross Entropy method for combinatorial optimization is proposed by Reuven Y.

最大团问题是一个经典的组合优化问题，在理论研究和实际应用方面都有重要的价值，本文对最大团问题的最新研究进展做了分析综述。

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

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

The maximum network flow problem is not only a classical combinatorial optimization problem, but also a special linear programming problem.

网络最大流问题是一个经典的组合优化问题，同时也是一个特殊的线性规划问题。

Job-shop scheduling is a typical combinatorial optimization problem, and large scale scheduling optimization is one of such difficult optimization problems.

作业车间调度是一种典型的组合优化问题，大规模的调度优化是该类问题的难点。

Vehicle routing problem is a typical combinatorial optimization problem, which is a simplified form of various complex problems.

车辆路径问题( Vehicle routing problem，简记VRP)是一个经典的组合优化问题，是多种复杂问题的一种简化形式。

the container loading problem with wide practical application is a combinatorial optimization problem, and is np-hard problem.

集装箱装载问题是一种有广泛应用背景的组合优化问题，它属于np-hard问题。

QoS multicast routing problem is a nonlinear combinatorial optimization problem,which has been proved that the problem is NP-complete problems.

QoS组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。

Graph Coloring Problem is one of the typical NP-hard problems in combinatorial optimization problem.

图着色问题（GCP，Graph Coloring Problem）是经典的NP-Hard组合优化问题之一。

Quadratic assignment problem is a NP-hard combinatorial optimization problem and has been applied in various fields. There are always many zero elements in the flow matrix or distance matrix of the quadratic assignment problem instances which are abstracted from the practical problems. Much computation time can be saved if we can first reduce the size of the problem by using its zero elements.

二次分配问题(quadratic assignment problem， QAP)是应用于诸多领域的组合优化NP-难题，许多从实际问题中抽象出来的二次分配问题，其流矩阵与距离矩阵中存在大量零元素，如果在该类二次分配问题的求解中，能够充分利用这些零元素的信息，将大大缩减问题的规模，节省大量运算时间。

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.

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