Notes on Greedy Local Search
Can be very effective for some problems. The worst case time is not that bad.
Examining all the neighbors and choosing the best is sometimes called “steepest decent”.
An alternative is “random decent”. Randomly choose a neighbor and move to it if its cost is smaller.
Another alternative is “first decent”. Try the neighbors in order and move to the first improvement.