Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems. - Derek E. Armstrong; Sheldon H. Jacobson (J. Glob. Optim., 2003)

Polynomial transformations and data-independent neighborhood functions. - Derek E. Armstrong; Sheldon H. Jacobson (Discret. Appl. Math., 2004)

Data-independent neighborhood functions and strict local optima. - Derek E. Armstrong; Sheldon H. Jacobson (Discret. Appl. Math., 2005)

Analyzing the Complexity of Finding Good Neighborhood Functions for Local Search Algorithms. - Derek E. Armstrong; Sheldon H. Jacobson (J. Glob. Optim., 2006)

Order preserving reductions and polynomial improving paths. - Derek E. Armstrong; Sheldon H. Jacobson (Oper. Res. Lett., 2006)

An analysis of neighborhood functions on generic solution spaces. - Derek E. Armstrong; Sheldon H. Jacobson (Eur. J. Oper. Res., 2008)