Cover Image

Approximate Local Search in Combinatorial Optimization

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
Year of publication:
2004-12-10
Authors: Orlin, James ; Punnen, Abraham ; Schulz, Andreas
Institutions: Sloan School of Management, Massachusetts Institute of Technology (MIT)
Extent:
application/pdf
Series:
Type of publication: Book / Working Paper
Notes:
The text is part of a series 1721.1 Number 4325-03
Source:
Persistent link: https://www.econbiz.de/10005587564
Similar items by person