Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization

by Emile Aarts
3/5
(4 votes)

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

First published
2018
Publishers
Princeton University Press
Subjects
Combinatorial optimization·Algorithms·Heuristic programming

Books

Similar books