Research on Heuristic Algorithm of Combinatorial Optimization
Shuwen Dai · Journal of Huainan Vocational & Technical College · 2005
In practice problems of combinatorial optimization, it is hard to get optimal solution of NP(Non-deterministic Polynomial)problems, such as Knapsack problem、TSM problem, in polynomial time consumption. Resolving these problems must consult to heuristic algorithms. Briefly introduces the concept of computing complexity, list several common heuristic algorithms, and present nature language description of these algorithms.