Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3539Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Orlin, James B. | - |
| dc.creator | Punnen, Abraham P. | - |
| dc.creator | Schulz, Andreas S. | - |
| dc.date | 2003-08-15T19:49:25Z | - |
| dc.date | 2003-08-15T19:49:25Z | - |
| dc.date | 2003-08-15T19:49:25Z | - |
| dc.date.accessioned | 2013-06-04T16:19:48Z | - |
| dc.date.available | 2013-06-04T16:19:48Z | - |
| dc.date.issued | 2013-06-05 | - |
| dc.identifier | http://hdl.handle.net/1721.1/3539 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Local 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 schem | - |
| dc.format | 173594 bytes | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | MIT Sloan School of Management Working Paper;4325-03 | - |
| dc.subject | Local Search | - |
| dc.subject | Neighborhood Search | - |
| dc.subject | Approximation Algorithms | - |
| dc.subject | Computational Complexity | - |
| dc.subject | Combinatorial Optimization | - |
| dc.subject | 0/1-Integer Programming | - |
| dc.title | Approximate Local Search in Combinatorial Optimization | - |
| dc.type | Working Paper | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.