Skip to main content alibris logo
Local Search in Combinatorial Optimization - Aarts, Emile (Editor), and Lenstra, Jan Karel (Editor)
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

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 variants from both a theoretical and practical point of view, each topic discussed ...

loading
Local Search in Combinatorial Optimization 2003, Princeton University Press, Princeton

ISBN-13: 9780691115221

Revised edition

Trade paperback

Local Search in Combinatorial Optimization 1997, Wiley, Chichester, England

ISBN-13: 9780471948223

Hardcover