Local Search in Combinatorial Optimization

Valutazione media 3
( su 4 valutazioni fornite da Goodreads )
 
9780691115221: 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 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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

From the Publisher:

In recent years major methodological progress has been made in the design and analysis of local search algorithms in combinatorial optimization. Until now the results have been scattered throughout the available literature. This is the first book to collect results, consolidate the insights and stimulate further progress in the field. Chapters on simulated annealing, tabu search, genetic algorithms and neural networks, applications of local search to problems in management science and engineering, including the traveling salesman problem, vehicle routing, machine scheduling, VLSI design and code design.

From the Inside Flap:

Local Search in Combinatorial Optimization Edited by Emile H. L. Aarts Philips Research Laboratories, Eindhoven and Eindhoven University of Technology, Eindhoven Jan Karel Lenstra Eindhoven University of Technology, Eindhoven and CWI Amsterdam In the past three decades local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization. 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 a reasonable time. This area of discrete mathematics is of great practical use and is attracting ever increasing attention. The contributions to this book cover local search and its variants from both a theoretical and practical point of view, each with a chapter written by leading authorities on that particular aspect. Chapters 1 to 7 deal with the theory of local search and describe the principal search strategies such as simulated annealing, tabu search, genetic algorithms and neural networks. The remaining chapters present a wealth of results on applications of local search to problems in management science and engineering, including the traveling salesman problem, vehicle routing, machine scheduling, VLSI design and code design. This book is an important reference volume and an invaluable source of inspiration for advanced students and researchers in discrete mathematics, computer science, operations research, industrial engineering and management science. Contents Preface Contributors I Introduction Emile H. L. Aarts, Jan Karel Lenstra 2 Computational complexity Mihalis Yannakakis 3 Local improvement on discrete structures Craig A. Tovey 4 Simulated annealing Emile H. L. Aarts, Jan H. M. Korst, Peter J. M. van Laarhoven 5 Tabu search Alain Hertz, Eric Taillard, Dominique de Werra 6 Genetic algorithms Heinz M?hlenbein 7 Artificial neural networks Carsten Peterson, Bo S?derberg 8 The travelling salesman problem: a case study David S. Johnson, Lyle A. McGeoch 9 Vehicle routing: modern heuristics Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin 10 Vehicle routing: handling edge exchanges Gerard A. P. Kindervater, Martin W. P. Savelsbergh 11 Machine scheduling Edward J. Anderson, Celia A. Glass, Chris N. Potts 12 VLSI layout synthesis Emile H. L. Aarts, Peter J. M. van Laarhoven, C. L. Liu, Peichen Pan 13 Code design liro S. Honkala, Patric R. J. ?sterg?rd Bibliography Author index Subject index

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

I migliori risultati di ricerca su AbeBooks

1.

Emile Aarts
Editore: Princeton University Press (2003)
ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Quantità: 2
Da
Books2Anywhere
(Fairford, GLOS, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Princeton University Press, 2003. PAP. Condizione libro: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Codice libro della libreria WP-9780691115221

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 50,43
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 10,08
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

2.

Editore: Princeton University Press (2003)
ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Paperback Quantità: 1
Da
Irish Booksellers
(Rumford, ME, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Princeton University Press, 2003. Paperback. Condizione libro: New. book. Codice libro della libreria 0691115222

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 62,70
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

3.

Editore: Princeton University Press, United States (2003)
ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Paperback Quantità: 1
Da
The Book Depository
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Princeton University Press, United States, 2003. Paperback. Condizione libro: New. With a New preface by the editors. Language: English . Brand New Book. 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 Muhlenbein, Carsten Peterson, Bo Soderberg, 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. Ostergard. Codice libro della libreria AAH9780691115221

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 67,40
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

4.

Editore: Princeton University Press, United States (2003)
ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Paperback Quantità: 1
Da
The Book Depository US
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Princeton University Press, United States, 2003. Paperback. Condizione libro: New. With a New preface by the editors. Language: English . Brand New Book. 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 Muhlenbein, Carsten Peterson, Bo Soderberg, 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. Ostergard. Codice libro della libreria AAH9780691115221

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 67,70
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

5.

Editore: Princeton University Press (2017)
ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Paperback Quantità: 2
Print on Demand
Da
Murray Media
(North Miami Beach, FL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Princeton University Press, 2017. Paperback. Condizione libro: New. This item is printed on demand. Codice libro della libreria P110691115222

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 70,50
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 2,56
In U.S.A.
Destinazione, tempi e costi

6.

Emile Aarts
Editore: Princeton University Press (2003)
ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Quantità: > 20
Print on Demand
Da
Pbshop
(Wood Dale, IL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Princeton University Press, 2003. PAP. Condizione libro: New. New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice libro della libreria IP-9780691115221

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 70,46
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,41
In U.S.A.
Destinazione, tempi e costi

7.

Emile Aarts, Jan Karel Lenstra
Editore: Princeton University Press
ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Paperback Quantità: 2
Da
THE SAINT BOOKSTORE
(Southport, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Princeton University Press. Paperback. Condizione libro: new. BRAND NEW, Local Search in Combinatorial Optimization (With a New preface by the editors), Emile Aarts, Jan Karel Lenstra, 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 Muhlenbein, Carsten Peterson, Bo Soderberg, 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. Ostergard. Codice libro della libreria B9780691115221

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 69,74
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 7,76
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

8.

ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Quantità: 2
Da
BWB
(Valley Stream, NY, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Condizione libro: New. Depending on your location, this item may ship from the US or UK. Codice libro della libreria 97806911152210000000

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 81,29
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

9.

Emile Aarts (Editor), Jan Karel Lenstra (Editor)
Editore: Princeton University Press (2003)
ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Paperback Quantità: 1
Da
Ergodebooks
(RICHMOND, TX, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Princeton University Press, 2003. Paperback. Condizione libro: New. Codice libro della libreria DADAX0691115222

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 78,26
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,41
In U.S.A.
Destinazione, tempi e costi

10.

Emile Aarts
Editore: Princeton University Press (2003)
ISBN 10: 0691115222 ISBN 13: 9780691115221
Nuovi Quantità: > 20
Print on Demand
Da
Books2Anywhere
(Fairford, GLOS, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Princeton University Press, 2003. PAP. Condizione libro: New. New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000. Codice libro della libreria IP-9780691115221

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 72,51
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 10,07
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

Vedi altre copie di questo libro

Vedi tutti i risultati per questo libro