Local Search in Combinatorial Optimization /

Local Search in Combinatorial Optimization / / ed. by Jan Karel Lenstra, Emile Aarts.

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

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
MitwirkendeR:
Aarts, Emile H . L.,
Aarts, Emile H. L.,
Anderson, Edward J.,
Gendreau, Michel,
Glass, Celia A.,
Hertz, Alain,
Honkala, Iiro S.,
Johnson, David S.,
Kindervater, Gerard A. P.,
Korst, Jan H. M.,
Laporte, Gilbert,
Lenstra, Jan Karel,
Liu, C. L.,
McGeoch, Lyle A.,
Mühlenbein, Heinz,
Pan, Peichen,
Peterson, Carsten,
Potts, Chris N.,
Potvin, Jean-Yves,
Savelsbergh, Martin W. P.,
Soderberg, Bö,
Taillard, Eric,
Tovey, Craig A.,
Yannakakis, Mihalis,
de Werra, Dominique,
van Laarhoven, Peter J. M.,
Östergård, Patric R. J.,
HerausgeberIn:
Aarts, Emile,
Lenstra, Jan Karel,
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2018]
©2003
Year of Publication:2018
Language:English
Online Access:
Physical Description:1 online resource
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first

Similar Items