QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
The hot rolling lot planning in iron and steel enterprises is a large-scale combination optimization problem with many restrictions.
钢铁生产中热轧批量计划编制属于多约束情况下大规模组合优化问题。
Timetabling Problem (TP) is a Multiobjective Combination Optimization Problem with constraints, and also has been proved NP-Completed.
排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP完全问题。
Vehicle Routing problem (VRP) is a combination optimization problem in transportation logistics, which has been applied in many fields. It is a strong NP problem.
车辆路径问题是一类在物流配送调度中具有广泛应用的组合优化问题，属于强np难题。
Automatic Test Paper is a combination of multi-objective constrained optimization problem.
智能组卷是一个多约束目标的组合优化问题。
Function optimization experiments show that which operator works better in an algorithm depends on both the combination capability of the operator and the problem to be optimized.
函数优化实验研究表明，在算法中采用何种离散重组算子较为合适与算子的组合能力有关，也与优化问题有关。
The generalized assignment problem is the typical combination optimization question.
广义分配问题是典型的组合优化问题。
The Film Deliverer Problem(FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman Problem(TSP).
影片递送问题（简称FDP）是组合优化的一个新问题，它比旅行商问题（简称TSP）复杂得多。
The vessel stowage planning is not only a complex combination and optimization problem, but also a NP-Complete problem.
大型集装箱船舶配载问题是一个复杂的组合优化问题，而且是一个NP问题。
In this paper, the NP-complete problem in combination and optimization having been solved with DNA computing is mainly introduced, and the complexity of these methods is analyzed briefly.
主要介绍了目前利用DNA计算已经解决的组合优化中的NP -完全问题，并简单地分析了它们的复杂性。
Logistic vehicle routing problem is combination optimization that is difficult to solve. Due to its NP characteristics, we can't get satisfying results when we use exact approaches.
配送车辆优化调度问题是一类求解较难的组合优化问题，由于其NP难特性，采用精确优化方法有一定的局限性，不能得到令人满意的结果。
Just as this paper points out, most problems about combination and sequential optimization are in fact NP-complete, so, it's impossible to find a general algorithm to solve all the problem presently.
正如文中所指出的那样，绝大多数组合与时序优化问题，实际上都是NP -完全问题，因而试图给出现实可行的一劳永逸的通用算法在目前是办不到的。
Power Distribution Network Optimization Planning is a complicated nonlinear optimizing combination problem.
配电网规划是一个复杂的非线性组合优化问题。
The Film Deliverer problem (FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman problem (TSP).
影片递送问题(简称FDP)是组合优化的一个新问题，它比旅行商问题(简称TSP)复杂得多。
The crew scheduling belongs to the typical combination-optimization problem and has some traits such as complexity, huge data, multi-aims and multi-restriction. It is usually solved by subsection.
机组编排属于典型的组合优化问题，具有情况复杂、数据量大、优化目标和限制条件多等特点，通常采用分段解决。
The crew scheduling belongs to the typical combination-optimization problem and has some traits such as complexity, huge data, multi-aims and multi-restriction. It is usually solved by subsection.
机组编排属于典型的组合优化问题，具有情况复杂、数据量大、优化目标和限制条件多等特点，通常采用分段解决。
应用推荐