Integer Programming: Optimization and Evaluation Are Equivalent
Author(s)Orlin, James B.; Punnen, Abraham P.; Schulz, Andreas S.
MetadataShow full item record
We 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.
Link to conference publication published by Springer: http://dx.doi.org/10.1007/978-3-642-03367-4
DepartmentSloan School of Management
Lecture Notes in Computer Science
Springer Science + Business Media B.V.
Orlin, James B., Abraham P. Punnen, and Andreas S. Schulz. “Integer Programming: Optimization and Evaluation Are Equivalent.” Algorithms and Data Structures. Ed. Frank Dehne et al. Vol. 5664. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. 519-529. (Lecture Notes in Computer Science)
Author's final manuscript