Local search algorithms for combinatorial 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 epsilon-local optimality and...

Includes bibliographical references (p. 25-27).

Includes bibliographical references (p. 8-9).

Includes bibliographical references (p. 25-26).

Includes bibliographical references (p. 40-42).