combinatorial optimization problems的意思|示意
组合最优化问题
combinatorial optimization problems的网络常见释义
组合最佳化问题 蚁群寻优法对于求解困难的组合最佳化问题(Combinatorial Optimization Problems)，已被证 明有相当好的成效(Maniezzo等, 1994；Dorigo等, 1991)，并在学术界中引起积极的讨論与研究。
属于组合最佳化问题 離散最佳化设计是属于组合最佳化问题(combinatorial optimization problems)， 其不可微性， 使得传统上较为有效率的數学规划法和最佳准则法不易或无法直接应用。
combinatorial optimization problems相关短语
1、 classical combinatorial optimization problems 典型的组合优化问题
combinatorial optimization problems相关例句
Scheduling is one of the most important combinatorial optimization problems. It is very important in industrial production, manufacturing systems and other fields.
生产调度是一类重要的组合优化问题，在工业生产、制造系统等领域应用广泛。
It is well-known that the optimal storage on sequential access peripheral problems is a fundamental problem in combinatorial optimization problems.
顺序存取设备的最优存储是组合优化中的一个重要问题。
The research of the Parallel Immune Algorithm application will help to solve other combinatorial optimization problems.
并行免疫算法的应用研究将有助于其他组合优化问题的解决。
In order to solve NP - shop scheduling combinatorial optimization problems, an immune forgotten algorithm for job shop scheduling is proposed.
为了解决车间调度NP组合优化的难题，提出了基于免疫遗忘的车间调度算法。
Due to the high parallelism and recognition ability of the biomolecules in biochemical reactions, biomolecular computing behaves great advantage in solving combinatorial optimization problems.
由于生物分子在化学反应中具有高度的并行性和识别能力，使生物分子计算在解决组合优化问题中显示出巨大的优势。
The path optimization problem belongs to combinatorial optimization problems, which is solved generally by using heuristic search algorithm.
路径优化问题属于组合优化问题，而解决组合优化问题一般使用启发式搜索算法。