combinatorial optimization problem中文是什么意思

发音:

中文翻译
造句

组合最优化问题

optimization n. 最佳化，最优化。
problem n. 1.问题，课题；疑难问题；令人困惑的情况。 2.【 ...
combinatorial optimization 组合优化; 组合最优化
combinatorial problem 组合问题; 组合最优化问题
journal of combinatorial optimization 优化组合杂志
optimization problem 最佳化问题; 最优化问题
combinatorial covering problem 组合复盖问题
combinatorial matching problem 组合匹配问题
discrete optimization problem 离散型最优化问题; 离散最优化问题
linear optimization problem 线性最优化问题
multidimensional optimization problem 多维最优化问题
secondary optimization problem 次最优化问题
separable optimization problem 可分最优问题
static optimization problem 静态最优化问题
combinatorial 组合的
combinatorial algorithm 组合算法
combinatorial analysis 组合分析
combinatorial association 组合联合
combinatorial chemistry 组合化学
combinatorial circuit 组合电路
combinatorial closure 组合闭包
combinatorial completeness 组合完备性
combinatorial compression 组合压缩
combinatorial construction 合并结构

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

Ant colony optimization ( aco ) algorithm is a nature - inspired metaheuristic algorithm . it has experienced more than 10 years ’ development since it was proposed and has become an efficient tool for solving combinatorial optimization problem
蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。
Dp technique is a high efficiency algorithm to solve combinatorial optimization problems by divided the multidimensional problem into multiple 1 - dimension problems . when this technique resorts to accumulate multiple frames , there are some disadvantages
动态规划算法是一种解决组合寻优问题的高效算法,通过将n维问题变换为n个一维优化问题,一个一个地求解的方法,很好的提高了效率。
The maximum clique problem ( mcp ) is a classical combinatorial optimization problem which belongs to np - hard , and many practical problems can be formulated to it . therefore , studying the mcp is full of significance both in theory and in practice
最大团问题是一个经典的np难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。
To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks ( hmb ) , an intelligent virtual design method was proposed with combining modern intelligent optimization methods with virtual design technology
摘要为解决液压集成块设计中外部布局和内部布孔集成的组合优化问题，提出了一种融合现代智能优化方法和虚拟设计技术的智能虚拟设计方法。
Ant colony algorithm is a novel simulated evolutionary algorithm , which is used to solve the optimization problems through simulating the way of ants finding the shortest path for food . this algorithm has been applied successfully to combinatorial optimization problems such as traveling salesman problem
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题，目前在旅行商问题等组合优化问题中有成功的应用。
Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs . the theory of scheduling has become a very important subject after half a century ' s development , and its application is very extensive
排序问题是一类重要的组合优化问题，它是利用一些处理机、机器或资源最优的完成一批给定的任务或作业，经过近半个世纪的努力，排序理论已经发展成一门相当重要的学科，并且应用非常广泛。
Traveling salesman problem is combinatorial optimization problem in graph theory , it has npc computation complexity , and lots of problem can transfer to traveling salesman problem . the computation of tsp is analyzed , then the hopfield network method for solving tsp is given , at last we solve 10 - citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling
首先分析了旅行商问题在穷举搜索法下的工作量；其次给出了求解旅行商问题的hopfield神经网络方法，同时分析了利用人工神经网络求解旅行商问题所存在的问题；最后利用混饨神经网络模型求解10城市旅行商问题和中国旅行商问题。
This problem has vide applications in real areas , such as the design of water and electricity supply networks , and communication networks , etc . at the same time , the problem is also closely related with some classical combinatorial optimization problems , including the steiner problem and the travelling salesman problem , which are well - known . so , it is of great importance to study it
所谓欧几里德2 -连通steiner网络问题，就是对于给定的平面点集p ，确定它的长度最小的2 -连通steiner网络，该问题与组合最优化中著名的steiner问题和旅行售货员问题有关，同时在水、电供应网络和通讯网络等设计中也有非常广泛的应用，所以对该问题的研究具有重要的意义。
Vsp is both a pivotal tache in logistic distribution optimization and indispensable in electronic commerce . it can increase logistic economic benefit and realize logistic rationalization . the systemic study on the theory and method of vsp is the base on the growth of logistic intensivism , the establishment of modem chain of command , the development of its and ec . now , the problem is not only applied to the field of auto transportation , but also to ship avigation communication electricity industry management computer application etc . the algorithm has been applied into many combinatorial optimization problems such as the trainman ' s shift arrangement in avigation the optimization design of cargo arrangement in ship company
对货运车辆进行调度优化，可以提高物流经济效益、实现物流科学化。对货运车辆调度优化理论与方法进行系统研究是物流集约化发展、建立现代调度指挥系统、发展智能交通运输系统和开展电子商务的基础。目前，问题的形式已有很大发展，该问题以不仅仅局限于汽车运输领域，在水运、航空、通讯、电力、工业管理、计算机应用等领域也有一定的应用，其算法已用于航空乘务员轮班安排、轮船公司运送货物经过港口与货物安排的优化设计、交通车线路安排、生产系统中的计划与控制等多种组合优化问题。
It can be boiled down to combinatorial optimization problem in mathematics . on the basis of summarizing the complexity and structural features of hmb and rules of its design and manufacture and analyzing the spatial relationship in 3d layout of hmb , the expressions of relevant variants are put forward using the object - oriented approach
在全面总结液压集成块设计问题的复杂性特点，以及集成块类零部件的结构特征和设计、制造信息组成规律的基础上，本文深入分析了集成块立体布局的空间关系，用面向对象方法定义了与该问题有关的特征变量的示性表达式，给出优化目标和约束条件，进而确立了集成块设计问题的数学优化模型。

更多例句： 1 2 3

推荐英语阅读

combinatorial optimization problem的中文翻译，combinatorial optimization problem是什么意思，怎么用汉语翻译combinatorial optimization problem，combinatorial optimization problem的中文意思，combinatorial optimization problem的中文，combinatorial optimization problem in Chinese，combinatorial optimization problem的中文，combinatorial optimization problem怎么读，发音，例句，用法和解释由查查在线词典提供，版权所有违者必究。

Last modified time:Sat, 16 Aug 2025 00:29:56 GMT