Integer Programming: Optimization and Evaluation Are Equivalent

Abstract

Link to conference publication published by Springer: http://dx.doi.org/10.1007/978-3-642-03367-4We show that if one can find the optimal value of an integer linear programming problem in polynomial time, then one can find an optimal solution in polynomial time. We also present a proper generalization to (general) integer programs and to local search problems of the well-known result that optimization and augmentation are equivalent for 0/1-integer programs. Among other things, our results imply that PLS-complete problems cannot have “near-exact” neighborhoods, unless PLS = P.United States. Office of Naval Research (ONR grant N00014-01208-1-0029