Description: In management science, computer science, molecular physics, biology, VLSI design, code design, image processing and electronic engineering and other fields, there are a large number of combinatorial optimization problems. For example, the traveling salesman problem, the maximum cut problem ,0-1 knapsack problem, graph coloring problems, equipment problems and wiring layout problems, these problems have yet to find a polynomial time algorithm.
To Search:
File list (Check if you may need any files):
MNTH.doc
Download