MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Sloan School of Management
  • Sloan Working Papers
  • View Item
  • DSpace@MIT Home
  • Sloan School of Management
  • Sloan Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Approximate Local Search in Combinatorial Optimization

Author(s)
Orlin, James; Punnen, Abraham; Schulz, Andreas
Thumbnail
Download4325-03.pdf (295.0Kb)
Metadata
Show full item record
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
Date issued
2004-12-10
URI
http://hdl.handle.net/1721.1/7407
Series/Report no.
MIT Sloan School of Management Working Paper;4325-03

Collections
  • Sloan Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.