Mohlo by se vám také líbit

Více informací o knize Local Search in Combinatorial Optimization

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 296 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Optimization

• Plný název: Local Search in Combinatorial Optimization
• Autor: Emile Aarts, Jan Karel Lenstra
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 528
• EAN: 9780691115221
• ISBN: 0691115222
• ID: 04640715
• Nakladatelství: Princeton University Press
• Hmotnost: 754 g
• Rozměry: 156 × 235 × 31 mm
• Datum vydání: 03. August 2003

Oblíbené z jiného soudku

---

---

---