Copper Mine is a very complex problem of nonlinear combined optimization.
铜矿填体优十复非性组合优问题。
Traveling Salesman Problem(TSP) is a classic combined optimization problem and it is proved that TSP is NP hard.
TSP（旅行商）问题作为经典的组合优化问题，已经被证明是一个NP难题。
A combined optimization decision tree algorithm suitable for a large scale and high dimension data-base is presented.
提出了一种适合于大规模高维数据库的组合优化决策树算法。
应用推荐