证明了求其最优解是一个NP-困难问题(NP-hard problem);对求最优解的分枝估界法(branch and bound method),给出一个估界法及求解的计算机程序框图。
基于8个网页-相关网页
As the task allocation problem is a recognized NP-hard problem, constructing effective approximation algorithms ro heuristic algorithms is a research focus.
由于任务分配问题是NP困难问题,构造有效的近似算法或启发式算法是目前研究的热点。
参考来源 - 并行计算系统中任务分配问题算法研究·2,447,543篇论文数据，部分数据来源于NoteExpress
Test set problem is a NP-hard problem with wide applications.
测试集问题是一个有着广泛应用的NP难问题。
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难题。
应用推荐