Multiple Move Strategies

• Multiple move stategies were pioneered by Kernighan and Lin (1970).

• They have been proven to be very effective for the traveling salesman problem and the minimum cut graph partitioning problem.

Previous slide

Next slide

Back to first slide

View graphic version