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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Edited and with an introduction by Emile Aarts & Jan Karel Lenstra With a new preface by the editors
"[This] is the best current reference for local search methods. I would expect this volume to remain an important reference for quite a number of years."--William J. Cook, Georgia Institute of Technology
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: ZBK Books, Carlstadt, NJ, USA
Zustand: good. Fast & Free Shipping â" Good condition. It may show normal signs of use, such as light writing, highlighting, or library markings, but all pages are intact and the book is fully readable. A solid, complete copy that's ready to enjoy. Bestandsnummer des Verkäufers ZWV.0691115222.G
Anzahl: 1 verfügbar
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Paperback. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Bestandsnummer des Verkäufers G0691115222I3N00
Anzahl: 1 verfügbar
Anbieter: Labyrinth Books, Princeton, NJ, USA
Zustand: New. Bestandsnummer des Verkäufers 111724
Anzahl: 13 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 1038972-n
Anzahl: 1 verfügbar
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers WP-9780691115221
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers WP-9780691115221
Anzahl: 1 verfügbar
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Softcover. Zustand: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 90 AAR 9780691115221 Sprache: Englisch Gewicht in Gramm: 550. Bestandsnummer des Verkäufers 2501600
Anzahl: 1 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 1038972
Anzahl: 1 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. 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. Editor(s): Aarts, Emile; Lenstra, Jan Karel. Num Pages: 528 pages, 35 tables. 80 line illus. BIC Classification: PBU; PBV. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 156 x 235 x 31. Weight in Grams: 754. . 2003. Paperback. . . . . Bestandsnummer des Verkäufers V9780691115221
Anzahl: 1 verfügbar
Anbieter: Rarewaves USA, HEBRON, KY, USA
Paperback. Zustand: New. 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. Bestandsnummer des Verkäufers LU-9780691115221
Anzahl: Mehr als 20 verfügbar