combinatorial optimization中文什么意思

• 组合优化
• 组合最优化

• optimization:    n. 最佳化，最优化。
• combinatorial optimization problem:    组合最优化问题
• journal of combinatorial optimization:    优化组合杂志
• combinatorial:    组合的
• combinatorial algorithm:    组合算法

例句与用法

1. The pheromone - based parameterized probabilistic model for the aco algorithm is presented as the solution construction graph that the combinatorial optimization problem can be mapped on . based on the solution construction graph , the unified framework of the aco algorithm is presented . an iterative update procedure of the solutions distribution in the problem ' s probabilistic model is proposed , that will converge to the optimal solutions with probability one , then the minimum cross - entropy pheromone update rule is proposed to approximate the iterative update procedure by minimizing the cross - entropy distance and monte - carlo sampling
   基于解空间参数化概率分布模型，首先提出了一个以概率1收敛于最优解的解空间概率分布的迭代更新过程，然后提出了通过最小化不同分布间的交互熵距离以及蒙特卡洛采样来逼近此迭代过程的最小交互熵信息素更新规则，接着分别给出了弧模式以及结点模式信息素分布模型下的最小交互熵等式。
2. Analyzed the similarity between scheme solving problem and traveling salesman problem ( tsp ) , 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
   摘要通过分析概念设计方案求解问题与旅行商问题的相似性，将方案求解问题转化为组合优化的最优路径问题，建立了基于动态规划的解空间模型和基于最长路径的优化模型。
3. The cores of the task planning in joint campaign are tasks and actions . the aim of the task planning in joint campaign is how to distribute the combat resources to each task efficiently . taking every constraints of the distribution process into account , this distribution problem is actually a combinatorial optimization problem
   联合作战任务计划的核心是任务和行动,其目的就是如何有效的将作战资源分配到各个任务中去,考虑到分配过程中的各种约束,对这一问题的求解即是解决一个组合优化问题。
4. Three - dimensional packing ( tdp ) is a combinatorial optimization and hp - complete problem and applied widely to the mechanical manufacture and traffic transportation industries . up to now there are varieties of heuristic algorithms to solve the tdp because of its high complication , we discuss the heuristic algorithm deeply in this paper and apply the simulated annealing ( sa ) algorithm to the packing system
   三维布局问题属于组合最优化问题和np完全问题，具有高度复杂性，用一般的数学方法根本无法求解，目前解决三维布局问题多为各种启发式方法，本文在对启发式方法进行深入探讨的基础上，采用了用于解决一般三维布局问题的模拟退火算法作为布局系统的操作算法。
5. The parametrization work of eck et al . , and the b - spline construction scheme of peters . the main contribution of this procedure are : it presents a combinatorial optimization method for builing a quadrilateral domain from a triangular one ; it presents an efficient method for fitting a gl b - spline surface of arbitrary topological type to unorganized points ; it introduces a scheme for adaptive refinement of the quadrilateral patch network
   论文工作利用了以前hoppe的表面重构工作， eck的参数化工作和peters的b样条重构方案，主要贡献在于：提出了从三角形域构造四边形域的组合优化方法；提出了从无序点重构具有任意拓扑结构g1连续nurbs曲面的有效方法；提出了四边形网格自适应细分的方案。

百科释义

In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.Schrijver, p.

其他语言

combinatorial optimizationとは意味：組み合せ最適化
combinatorial optimization 뜻：조합 최적화 조합 최적화
combinatorial optimization перевод：мат. комбинаторная оптимизация