Traveling salesman problem(TSP) is a NP complete combinatorial optimum problem.
旅行商问题是NP完全的组合优化问题。
The Job shop scheduling problem is a combinatorial optimum problem that is constrained with time, sequence and resource.
车间作业调度问题是一类具有时间约束、次序约束和资源约束的组合优化问题。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和NP完全问题，在一定时间内求其精确全局最优解是相当困难的。
应用推荐