9780691115221

Local Search in Combinatorial Optimization

ISBN 10: 0691115222 / 0-691-11522-2
ISBN 13: 9780691115221
Publisher: Princeton University Press
Publication Date: 2003
Binding: Softcover
Editorial Reviews:
Synopsis:

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.


Review:
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 Publisher

Review:
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

From the Inside Flap

 

Local Search in Combinatorial Optimization: Search Results

1.
International Edition
International Edition
Local Search in Combinatorial Optimization (ISBN: 0691115222 / 0-691-11522-2)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: Books Market (Hayward, CA, U.S.A.)
Bookseller Rating: 4-star rating
Quantity Available: 1

Book Description: Princeton University Press. PAPERBACK. Book Condition: New. 0691115222 Brand New International Edition . Cover and ISBN of the books might be different in some cases . Fast Shipping, Super Quality & Awesome Customer Support is Guaranteed!. Bookseller Inventory # FL-2-SEC-E#30-UP-691115222

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 20.99
Convert Currency
Shipping: US$ 3.99
Within U.S.A.
2.
Local Search in Combinatorial Optimization (ISBN: 9780691115221)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: Paperbackshop-US (Secaucus, NJ, U.S.A.)
Bookseller Rating: 5-star rating
Quantity Available: 1

Book Description: Princeton University Press, 2003. Paperback. Book Condition: New. New Book. Shipped from UK. Bookseller Inventory # WP-9780691115221

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 60.11
Convert Currency
Shipping: US$ 3.99
Within U.S.A.
3.
Local Search in Combinatorial Optimization Format: Paperback (ISBN: 0691115222 / 0-691-11522-2)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: INDOO (Avenel, NJ, U.S.A.)
Bookseller Rating: 4-star rating
Quantity Available: > 20

Book Description: Princeton University Press. Book Condition: New. Brand New. Bookseller Inventory # 0691115222

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 66.11
Convert Currency
Shipping: US$ 3.50
Within U.S.A.
4.
Local Search in Combinatorial Optimization (Paperback) (ISBN: 9780691115221)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: The Book Depository US (Gloucester, ., United Kingdom)
Bookseller Rating: 5-star rating
Quantity Available: 1

Book Description: Princeton University Press, United States, 2003. Paperback. Book Condition: New. 229 x 152 mm. 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 Mhlenbein, 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. Bookseller Inventory # AAH9780691115221

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 71.50
Convert Currency
Shipping: US$ 0.00
From United Kingdom to U.S.A.
5.
Local Search in Combinatorial Optimization (Paperback) (ISBN: 9780691115221)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: The Book Depository (Gloucester, UK, United Kingdom)
Bookseller Rating: 5-star rating
Quantity Available: 1

Book Description: Princeton University Press, United States, 2003. Paperback. Book Condition: New. 229 x 152 mm. 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 Mhlenbein, 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. Bookseller Inventory # AAH9780691115221

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 73.23
Convert Currency
Shipping: US$ 0.00
From United Kingdom to U.S.A.
6.
Local Search in Combinatorial Optimization (ISBN: 9780691115221)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: Paperbackshop-US (Secaucus, NJ, U.S.A.)
Bookseller Rating: 5-star rating
Quantity Available: > 20

Book Description: PRINCETON UNIV PR 01/07/2014, 2014. Paperback. Book Condition: New. New Book. This item is printed on demand. Shipped from US This item is printed on demand. Bookseller Inventory # IH-9780691115221

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 71.15
Convert Currency
Shipping: US$ 3.99
Within U.S.A.
7.
Local Search in Combinatorial Optimization (ISBN: 9780691115221)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: Books2Anywhere (Fairford, GLO, United Kingdom)
Bookseller Rating: 5-star rating
Quantity Available: 1

Book Description: Princeton University Press, 2003. Paperback. Book Condition: New. New Book. Shipped from UK. Bookseller Inventory # WP-9780691115221

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 60.02
Convert Currency
Shipping: US$ 15.33
From United Kingdom to U.S.A.
8.
Local Search in Combinatorial Optimization (Paperback) (ISBN: 0691115222 / 0-691-11522-2)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: Bobs Books (JRM) (Romulus, MI, U.S.A.)
Bookseller Rating: 4-star rating
Quantity Available: 1

Book Description: 2003. Paperback. Book Condition: New. 163mm x 32mm x 233mm. Paperback. 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. L.Shipping may be from multiple locations in the US or from the UK, depending on stock availability. 526 pages. 0.757. Bookseller Inventory # 9780691115221

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 78.85
Convert Currency
Shipping: US$ 0.00
Within U.S.A.
9.
Local Search in Combinatorial Optimization (Paperback) (ISBN: 0691115222 / 0-691-11522-2)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: ABC Books (Lowfield Heath, CRAWL, United Kingdom)
Bookseller Rating: 4-star rating
Quantity Available: 1

Book Description: 2003. Paperback. Book Condition: New. 163mm x 32mm x 233mm. Paperback. 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 searc.Shipping may be from our UK, US or Australian warehouse depending on stock availability. 526 pages. 0.757. Bookseller Inventory # 9780691115221

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 75.38
Convert Currency
Shipping: US$ 22.15
From United Kingdom to U.S.A.
10.
Local Search in Combinatorial Optimization (ISBN: 9780691115221)
$product.getAuthor()
ISBN 10: 0691115222
ISBN 13: 9780691115221
Bookseller: Castle Rock (Bedford, NS, Canada)
Bookseller Rating: 5-star rating
Quantity Available: 1

Book Description: Book Condition: Brand New. Book Condition: Brand New * All orders are processed and shipped from Las Vegas, NV USA *. Bookseller Inventory # 97806911152211.0

Bookseller & Payment Information | More Books from this Seller | Ask Bookseller a Question

Add Book to Shopping Basket
Price: US$ 96.42
Convert Currency
Shipping: US$ 3.99
From Canada to U.S.A.
View All Listings for this Book