Further processing options

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

Full Description

Bibliographic Details
Authors and Corporations: Aarts, Emile (Other), Lenstra, Jan Karel (Other)
Other Authors: Aarts, Emile , Lenstra, Jan Karel
Type of Resource: E-Book
Language: English
Princeton, NJ Princeton University Press 2018
Source: Verbunddaten SWB
Notes: In English
ISBN: 9780691187563