| 1. | Time - table problem is a np - complete problem
排课表问题是np -完全问题。 |
| 2. | The vrp can be regarded as an extension of the tsp and it is np - complete
车辆路径问题可以看作是旅行售货员问题的推广，它是np -完备的问题。 |
| 3. | The crossing number of graph , which is an np - complete problem , has an important theory meaning
图的交叉数问题属于np -困难问题，对它的研究有重要的理论意义。 |
| 4. | Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局问题是具有np完备计算复杂度的离散组合优化问题。 |
| 5. | This problem refers to constructing minimum - cost spanning trees constrained by delay , which is known to be np - complete
该问题的目标是创建一棵覆盖源节点和目的节点的代价最小树,且满足端到端时延要求。 |
| 6. | Timetabling problem ( tp ) is a multiobjective combination optimization problem with constraints , and also has been proved np - completed
排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个np完全问题。 |
| 7. | Scheduling problems are known to be in general np - complete , only sub - optimal can be obtained by classical scheduling approaches in most cases
任务分配与调度问题是一类np问题，经典调度理论一般仅能获得问题的近似最优解。 |
| 8. | And of all scheduling problems , the job - shop scheduling problem ( jsp ) is most common and complicate , which is usually a typical np - complete problem
本文主要介绍了约束满足神经网络( csnn )在作业车间调度问题( jsp )中的应用。 |
| 9. | The quasi - physical and quasi - sociological methods for problem - solving is a new approach to solve problems including np - completed and other pure mathematical problems
拟物拟人方法是一种求解诸如np问题和其它困难数学问题的方法。 |
| 10. | Three - dimensional component packing is a combinatorial optimization and np - complete problem . it is difficult to find its exact global optimum
三维布局问题属于组合最优化问题和np完全问题，在一定时间内求其精确全局最优解是相当困难的。 |
