Title of article :
Polynomial transformations and data-independent neighborhood functions Original Research Article
Author/Authors :
Derek E. Armstrong، نويسنده , , Sheldon H. Jacobson، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Pages :
13
From page :
272
To page :
284
Abstract :
A neighborhood function that is polynomial in size and independent of the problem data, except that it may depend on the maximum absolute value of a number in an instance, is termed semi-reasonable. A semi-data-independent order transformation (SDIOT) is introduced such that if problem A SDIOT to problem B and B has a semi-reasonable neighborhood function, where the number of local optima is polynomial, then problem A has a semi-reasonable neighborhood function such that the number of local optima is polynomial. A large class of optimization problems is shown to SDIOT to Maximum Clause Weighted Satisfiability.
Keywords :
Local search algorithm , Computational complexity , NP-hard discrete optimization problem
Journal title :
Discrete Applied Mathematics
Serial Year :
2004
Journal title :
Discrete Applied Mathematics
Record number :
885939
Link To Document :
بازگشت