Approximate Local Search in Combinatorial Optimization

Approximate Local Search in Combinatorial Optimization

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....

Full description

Bibliographic Details
Main Authors: Orlin, James B., Punnen, Abraham P., Schulz, Andreas S.
Format: Working Paper
Language:en_US
Published: 2003
Subjects:
Local Search
Neighborhood Search
Approximation Algorithms
Computational Complexity
Combinatorial Optimization
0/1-Integer Programming
Online Access:http://hdl.handle.net/1721.1/3539

Internet

http://hdl.handle.net/1721.1/3539

Similar Items