Local Search in Combinatorial Optimization
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 researche…
Mehr
CHF 127.70
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
Versandkostenfrei
Produktdetails
- ISBN: 978-0-691-18756-3
- EAN: 9780691187563
- Produktnummer: 35944182
- Verlag: Princeton University Press
- Sprache: Englisch
- Erscheinungsjahr: 2018
- Plattform: PDF
- Masse: 0 KB
Über den Autor
Edited and with an introduction by Emile Aarts & Jan Karel LenstraWith a new preface by the editors
16 weitere Werke von Emile (Hrsg.) Aarts:
Bewertungen
Anmelden