東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Optimization by GRASP = greedy rando...

Resende, Mauricio G.C.

Linked to FindBook

Google Book

Amazon

博客來

Optimization by GRASP = greedy randomized adaptive search procedures /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Optimization by GRASP/ by Mauricio G.C. Resende, Celso C. Ribeiro.
Reminder of title:	greedy randomized adaptive search procedures /
Author:	Resende, Mauricio G.C.
other author:	Ribeiro, Celso C.
Published:	New York, NY :Springer New York : : 2016.,
Description:	xx, 312 p. :ill. (some col.), digital ;24 cm.
[NT 15003449]:	Foreword -- Preface -- 1. Introduction -- 2. A short tour of combinatorial optimization and computational complexity -- 3. Solution construction and greedy algorithms -- 4. Local search -- 5. GRASP: The basic heuristic -- 6. Runtime distributions -- 7. GRASP: extended construction heuristics -- 8. Path-relinking -- 9. GRASP with Path-relinking -- 10. Parallel GRASP heuristics -- 11. GRASP for continuous optimization -- 12. Case studies -- References -- Index.
Contained By:	Springer eBooks
Subject:	Mathematical optimization. -
Online resource:	http://dx.doi.org/10.1007/978-1-4939-6530-4
ISBN:	9781493965304

Optimization by GRASP = greedy randomized adaptive search procedures /
Resende, Mauricio G.C.

Optimization by GRASPgreedy randomized adaptive search procedures /[electronic resource] :by Mauricio G.C. Resende, Celso C. Ribeiro. - New York, NY :Springer New York :2016. - xx, 312 p. :ill. (some col.), digital ;24 cm.

Foreword -- Preface -- 1. Introduction -- 2. A short tour of combinatorial optimization and computational complexity -- 3. Solution construction and greedy algorithms -- 4. Local search -- 5. GRASP: The basic heuristic -- 6. Runtime distributions -- 7. GRASP: extended construction heuristics -- 8. Path-relinking -- 9. GRASP with Path-relinking -- 10. Parallel GRASP heuristics -- 11. GRASP for continuous optimization -- 12. Case studies -- References -- Index.

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.

ISBN: 9781493965304

Standard No.: 10.1007/978-1-4939-6530-4doiSubjects--Topical Terms:

517763
Mathematical optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.6

Optimization by GRASP = greedy randomized adaptive search procedures /
LDR:02908nmm a2200313 a 4500 001 2053759
003 DE-He213
005 20161026123312.0
006 m d
007 cr nn 008maaau
008 170510s2016 nyu s 0 eng d
020 $a 9781493965304 $q (electronic bk.)
020 $a 9781493965281 $q (paper)
024 7 $a 10.1007/978-1-4939-6530-4 $2 doi
035 $a 978-1-4939-6530-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a PBKS $2 bicssc
072 7 $a MAT006000 $2 bisacsh
082 0 4 $a 519.6 $2 23
090 $a QA402.5 $b .R433 2016
100 1 $a Resende, Mauricio G.C. $3 3166859
245 1 0 $a Optimization by GRASP $h [electronic resource] : $b greedy randomized adaptive search procedures / $c by Mauricio G.C. Resende, Celso C. Ribeiro.
260 $a New York, NY : $b Springer New York : $b Imprint: Springer, $c 2016.
300 $a xx, 312 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a Foreword -- Preface -- 1. Introduction -- 2. A short tour of combinatorial optimization and computational complexity -- 3. Solution construction and greedy algorithms -- 4. Local search -- 5. GRASP: The basic heuristic -- 6. Runtime distributions -- 7. GRASP: extended construction heuristics -- 8. Path-relinking -- 9. GRASP with Path-relinking -- 10. Parallel GRASP heuristics -- 11. GRASP for continuous optimization -- 12. Case studies -- References -- Index.
520 $a 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.
650 0 $a Mathematical optimization. $3 517763
650 0 $a Heuristic algorithms. $3 1066682
650 1 4 $a Mathematics. $3 515831
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 891040
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Operation Research/Decision Theory. $3 1620900
650 2 4 $a Industrial and Production Engineering. $3 891024
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 890894
700 1 $a Ribeiro, Celso C. $3 844704
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-1-4939-6530-4
950 $a Mathematics and Statistics (Springer-11649)