April 2018
Beginner to intermediate
426 pages
10h 19m
English
Some of these problems we mentioned are impossible to solve. However, there are techniques that can be used to achieve an approximate solution in a satisfactory time. One technique would be using heuristic algorithms. A solution produced by heuristics might not be the best of all solutions, but it is good enough to solve the problem at the time.
Some examples of heuristics are local search, genetic algorithms, heuristics routing, and machine learning. For more information, take a look at https://en.wikipedia.org/wiki/Heuristic_(computer_science).