The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
Graph Coloring problem (GCP) is an NP hard problem.
图着色问题(GCP)是NP完全问题。
The fill in problem for graphs is a well known NP hard problem.
图的最小填充问题是熟知的NP-困难问题。
应用推荐