Show simple item record

dc.contributor.authorOrlin, James B.
dc.contributor.authorPunnen, Abraham P.
dc.contributor.authorSchulz, Andreas S.
dc.date.accessioned2012-01-06T17:13:42Z
dc.date.available2012-01-06T17:13:42Z
dc.date.issued2009-01
dc.date.submitted2009-08
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/1721.1/68014
dc.descriptionLink to conference publication published by Springer: http://dx.doi.org/10.1007/978-3-642-03367-4en_US
dc.description.abstractWe 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.en_US
dc.description.sponsorshipUnited States. Office of Naval Research (ONR grant N00014-01208-1-0029)en_US
dc.language.isoen_US
dc.publisherSpringer Science + Business Media B.V.en_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/978-3-642-03367-4_45en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceProf. Orlin via Alex Caracuzzoen_US
dc.titleInteger Programming: Optimization and Evaluation Are Equivalenten_US
dc.typeArticleen_US
dc.identifier.citationOrlin, 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)en_US
dc.contributor.departmentSloan School of Managementen_US
dc.contributor.approverOrlin, James B.
dc.contributor.mitauthorSchulz, Andreas S.
dc.contributor.mitauthorOrlin, James B.
dc.relation.journalLecture Notes in Computer Scienceen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsOrlin, James B.; Punnen, Abraham P.; Schulz, Andreas S.en
dc.identifier.orcidhttps://orcid.org/0000-0002-9595-459X
dc.identifier.orcidhttps://orcid.org/0000-0002-7488-094X
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record