MIT Sloan School of Management Working Paper;4325-03
Abstract
Local search algorithms for combinational optimization problems are in general of pseudopolynomial running time and polynomial-time algorithms are often not known for finding locally optimal solutions for NP-hard optimization problems. We introduce the concept of
