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...
|Authors and Corporations:||,|
|Other Authors:||Aarts, Emile , Lenstra, Jan Karel|
|Type of Resource:||E-Book|
Princeton, NJ Princeton University Press 2018