Some methods to solve NP-hard

Abstract

The NP-hard problem is a very common problem in life such as the tourist problem, the backpack packing problem, the scheduling problem, etc. However, up to now all the research At home and abroad, we still have not found an exact solution in polynomial time to the NP-hard problem. Therefore, the author approaches to learn some methods for solving NP-hard problems that are appropriate and highly applicable.