Order preserving reductions and polynomial improving paths

Authors:
Derek E. Armstrong;Sheldon H. Jacobson
Affiliations:
BAE Systems, Advanced Information Technologies, 3865 Wilson Boulevard, Suite 600, Arlington, VA 22203, USA;Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, 1206 West Green Street (MC-244), Urbana, IL 61801-2906, USA
Venue:
Operations Research Letters
Year:
2006

Citing 6
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
How easy is local search?

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Approximate solution of NP optimization problems

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial transformations and data-independent neighborhood functions

Discrete Applied Mathematics
Data-independent neighborhood functions and strict local optima

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows that neighborhood transformations and data-independent order transformations preserve the length of improving paths and order of local optima of neighborhood functions. These results imply that finding effective neighborhood functions for Zero-One IP is at least as hard as finding effective neighborhood functions for any other NPO problem.