Local Search in Combinatorial Optimization

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its...

• Format: Paperback
• Language: English
• ISBN: 0691115222
• ISBN13: 9780691115221
• Release Date: August 2003
• Publisher: Princeton University Press
• Length: 528 Pages
• Weight: 1.70 lbs.
• Dimensions: 1.3" x 6.4" x 9.2"