Show simple item record

dc.contributor.authorOrlin, James B.
dc.contributor.authorPunnen, Abraham P.
dc.contributor.authorSchulz, Andreas S.
dc.date.accessioned2003-08-15T19:49:25Z
dc.date.available2003-08-15T19:49:25Z
dc.date.issued2003-08-15T19:49:25Z
dc.identifier.urihttp://hdl.handle.net/1721.1/3539
dc.description.abstractLocal search algorithms for combinatorial optimization problems are in general of pseudopolynomial running time and polynomial-time algorithms are often not known for finding locally optimal solutions for NP-hard optimization problems. We introduce the concept of epsilon-local optimality and show that an epsilon-local optimum can be identified in time polynomial in the problem size and 1/epsilon whenever the corresponding neighborhood can be searched in polynomial time, for epsilon > 0. If the neighborhood can be searched in polynomial time for a delta-local optimum, we present an algorithm that produces a (delta+epsilon)-local optimum in time polynomial in the problem size and 1/epsilon. As a consequence, a combinatorial optimization problem has a fully polynomial-time approximation scheme if and only if it has a fully polynomial-time augmentation schemen
dc.format.extent173594 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMIT Sloan School of Management Working Paper;4325-03
dc.subjectLocal Searchen
dc.subjectNeighborhood Searchen
dc.subjectApproximation Algorithmsen
dc.subjectComputational Complexityen
dc.subjectCombinatorial Optimizationen
dc.subject0/1-Integer Programmingen
dc.titleApproximate Local Search in Combinatorial Optimizationen
dc.typeWorking Paperen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record