Module Introduction to Heuristic

Introduction to Heuristic

**Frequency: 1/10** This is a type of problem that only requires finding an approximate solution because, until now, there have been no efficient algorithms to solve these problems exactly in polynomial time. There are indeed many heuristic algorithms available, but you can also create your own greedy solution to solve these problems.

Problems

Apple 1 / 1 800
Travelling Salesman Problem 3 46 / 103 2000
Custom keyboard 2 15 / 23 2000
Maximum clique 15 / 26 2000
Superstring 2 10 / 24 2000
Knapsack 5 18 / 35 2100
Min-Max mTSP 1 / 26 2500