Cover of Emile Aarts (EDT), Jan Karel Lenstra (EDT): Local Search in Combinatorial Optimization

Emile Aarts (EDT), Jan Karel Lenstra (EDT) Local Search in Combinatorial Optimization

Price for Eshop: 2624 Kč (€ 105.0)

VAT 0% included

New

E-book delivered electronically online

E-Book information

Princeton University Press

2018

PDF
How do I buy e-book?

978-0-691-18756-3

0-691-18756-8

Annotation

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.

Ask question

You can ask us about this book and we'll send an answer to your e-mail.