Title of article
Data-independent neighborhood functions and strict local optima Original Research Article
Author/Authors
Derek E. Armstrong، نويسنده , , Sheldon H. Jacobson، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
11
From page
233
To page
243
Abstract
The paper proves that data-independent neighborhood functions with the smooth property (all strict local optima are global optima) for maximum 3-satisfiability (MAX 3-SAT) must contain all possible solutions for large instances. Data-independent neighborhood functions with the smooth property for 0–1 knapsack are shown to have size with the same order of magnitude as the cardinality of the solution space. Data-independent neighborhood functions with the smooth property for traveling salesman problem (TSP) are shown to have exponential size. These results also hold for certain polynomially solvable sub-problems of MAX 3-SAT, 0–1 knapsack and TSP.
Keywords
Local search algorithm , Exponential neighborhood , Computational complexity
Journal title
Discrete Applied Mathematics
Serial Year
2005
Journal title
Discrete Applied Mathematics
Record number
886054
Link To Document