| Article ID: | iaor20061816 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 9 |
| End Page Number: | 16 |
| Publication Date: | Jan 2006 |
| Journal: | Operations Research Letters |
| Authors: | Jacobson Sheldon H., Armstrong Derek E. |
| Keywords: | combinatorial analysis, programming: integer |
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.