Local Search in Combinatorial Optimization
Seiten
2003
|
Revised edition
Princeton University Press (Verlag)
978-0-691-11522-1 (ISBN)
Princeton University Press (Verlag)
978-0-691-11522-1 (ISBN)
- Lieferbar (Termin unbekannt)
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
Covers local search and its variants from both a theoretical and practical point of view. This book is suitable for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science.
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.
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.
Emile Aarts is Vice-President and Scientific Program Director of the Philips Research Laboratories, Eindhoven, and a Professor of Computer Science at Eindhoven University of Technology. Jan Karel Lenstra is the John P. Hunter Chair and Professor of Industrial and Systems Engineering at the Georgia Institute of Technology.
| Erscheint lt. Verlag | 3.8.2003 |
|---|---|
| Zusatzinfo | 35 tables. 80 line illus. |
| Verlagsort | New Jersey |
| Sprache | englisch |
| Maße | 152 x 235 mm |
| Gewicht | 709 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Angewandte Mathematik |
| Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik | |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 0-691-11522-2 / 0691115222 |
| ISBN-13 | 978-0-691-11522-1 / 9780691115221 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren
Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
CHF 97,90
