We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Approximate Local Search in Combinatorial Optimization

Thumbnail Image
Download
Name

4325-03.pdf

Size

295.02 KB

Format

Adobe PDF

Checksum (MD5)

7fc36808b96a4f6b671f6c5a2852109c

Author(s)
Orlin, James
•
Punnen, Abraham
•
Schulz, Andreas
Date Issued
December 10, 2004
Series/Report no.
MIT Sloan School of Management Working Paper;4325-03
Abstract
Local search algorithms for combinational 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
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.