NP - hard problem的意思|示意

美 / / 英 / /

NP困难问题


NP - hard problem的网络常见释义

NP完全问题 中国最大的综合性文献数据库 -维普资讯 关键词: 集合覆盖 NP完全问题 遗传算法 启发式[gap=521]Key words: set covering problem; NP - hard problem; genetie algorithm; heuristie

NP - hard problem相关短语

1、 NP-hard problem NP困难问题 ; 困难问题 ; NP难度问题

2、 NP hard problem NP难问题 ; np难

3、 Strongly NP-hard Knapsack Problem 强NP难背包问题

NP - hard problem相关例句

But it is a NP-Hard problem to get the minimal attribute reduction.

但求取任意问题的最小属性集是一个NP难问题。

The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.

带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。

In order to deal with the timetable problem, the NP-hard problem, this paper designs a new method by the use of R_timetable, which is based on the character of college courses arrangement.

为了处理课程表问题这个NP完全类问题,根据大学编排课表的特点设计了一种全新的使用r _时刻表的设计方法。

Graph Coloring problem (GCP) is an NP hard problem.

图着色问题(GCP)是NP完全问题。

The problem of maximizing total weighted satisfaction level for single machine with fuzzy due-date is a NP-hard problem.

单机模糊交货期总加权满意程度最大化问题是一个NP -难问题。

Automatic test paper generation is a NP hard problem while restrictions exist.

试题库自动组卷问题是一个NP难题。