Optimization by GRASP

Name: Optimization by GRASP
Brand: Springer-Verlag New York Inc.
SKU: 9781493965281
Price: 87.8 EUR
Availability: InStock

Greedy Randomized Adaptive Search Procedures

Автор: Resende

Език:

Корици: С твърди корици

Издател: Springer-Verlag New York Inc.

Наличност: Външен склад

Изпращаме след 10-13 дни

87.80 € 171.72 лв

This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristi...

Информация за книгата

Автор

Resende

Език

Английски език

Корици

Книга - С твърди корици

Издадена

2016

страници

312

EAN

9781493965281

ISBN

149396528X

Enbook ID

13495056

Издател

Springer-Verlag New York Inc.

Теглоt

652

Размери

245 x 167 x 24

Пълно описание

This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristic that has enjoyed wide success in practice with a broad range of applications to real-world combinatorial optimization problems. The state-of-the-art coverage and carefully crafted pedagogical style lends this book highly accessible as an introductory text not only to GRASP, but also to combinatorial optimization, greedy algorithms, local search, and path-relinking, as well as to heuristics and metaheuristics, in general. The focus is on algorithmic and computational aspects of applied optimization with GRASP with emphasis given to the end-user, providing sufficient information on the broad spectrum of advances in applied optimization with GRASP. For the more advanced reader, chapters on hybridization with path-relinking and parallel and continuous GRASP present these topics in a clear and concise fashion. Additionally, the book offers a very complete annotated bibliography of GRASP and combinatorial optimization. For the practitioner who needs to solve combinatorial optimization problems, the book provides a chapter with four case studies and implementable templates for all algorithms covered in the text. This book, with its excellent overview of GRASP, will appeal to researchers and practitioners of combinatorial optimization who have a need to find optimal or near optimal solutions to hard combinatorial optimization problems.§

Може също да ви хареса

Клиенти, които купиха тази книга, купиха също

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Най-често търсени

Categories

Authors

Publishers

Продукти

Продукти

Optimization by GRASP

Greedy Randomized Adaptive Search Procedures

Информация за книгата

Пълно описание

Може също да ви хареса

Creep and Shrinkage

Interventional Nephrology

Once There Was a War

Lavender

The Ready Resource for Relief Society

ORT ALL STARS LEV 11A HUGE BEAST NE

Black Sands

Harry Potter's Journey to Hogwarts

Клиенти, които купиха тази книга, купиха също

Hof in Hartmann von Aues Erec. Lassen sich Muster der Artusromane wiederfinden?

Nina's Briefe an ihren Geliebten

Yo, Don Hernando Cortés : reflexiones en torno a la escritura cortesiana

BAKAIKUKO LEKU-IZENEZ HAUSNARREAN

CUADERNOS BARAH 5 ESCUCHAR EL SILENCIO