Store besparelser
Hurtig levering
Gemte
Log ind
0
Kurv
Kurv
Local Search in Combinatorial Optimization
Engelsk Paperback
Local Search in Combinatorial Optimization
Engelsk Paperback

699 kr
Tilføj til kurv
Sikker betaling
23 - 25 hverdage

Om denne bog

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 by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science.


In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård.




Product detaljer
Sprog:
Engelsk
Sider:
528
ISBN-13:
9780691115221
Indbinding:
Paperback
Udgave:
ISBN-10:
0691115222
Kategori:
Udg. Dato:
3 aug 2003
Længde:
31mm
Bredde:
235mm
Højde:
156mm
Forlag:
Princeton University Press
Oplagsdato:
3 aug 2003
Forfatter(e):
Products purchased together
Alternatives - PIE
Kategori sammenhænge