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

Travelling Salesman Problem 3 4 / 20 2000
Custom keyboard 2 1 / 4 2000
Maximum clique 2 / 5 2000
Superstring 2 2 / 5 2000
Knapsack 5 2 / 6 2100