東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Matheuristics = algorithms and imple...

Maniezzo, Vittorio.

FindBook

Google Book

Amazon

博客來

Matheuristics = algorithms and implementations /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Matheuristics/ by Vittorio Maniezzo, Marco Antonio Boschetti, Thomas Stutzle.
其他題名:	algorithms and implementations /
作者:	Maniezzo, Vittorio.
其他作者:	Boschetti, Marco Antonio.
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xviii, 214 p. :ill., digital ;24 cm.
內容註:	Part I: Contextual Issues -- 1. The Generalized Assignment Problem -- 2. Automatic Design for Matheuristics -- Part II: Metaheuristic Hybrids -- 3. Single Solution Metaheuristics -- 4. Population-Based metaheuristics -- Part III: Original Matheuristics -- 5. Diving Heuristics -- 6. Very Large-Scale Neighborhood Search -- 7. Decomposition Based Heuristics -- 8. Corridor Method -- 9. Kernel Search -- 10. Fore-and-Back.
Contained By:	Springer Nature eBook
標題:	Heuristic algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-70277-9
ISBN:	9783030702779

Matheuristics = algorithms and implementations /
Maniezzo, Vittorio.

Matheuristicsalgorithms and implementations /[electronic resource] :by Vittorio Maniezzo, Marco Antonio Boschetti, Thomas Stutzle. - Cham :Springer International Publishing :2021. - xviii, 214 p. :ill., digital ;24 cm. - EURO advanced tutorials on operational research,2364-687X. - EURO advanced tutorials on operational research..

Part I: Contextual Issues -- 1. The Generalized Assignment Problem -- 2. Automatic Design for Matheuristics -- Part II: Metaheuristic Hybrids -- 3. Single Solution Metaheuristics -- 4. Population-Based metaheuristics -- Part III: Original Matheuristics -- 5. Diving Heuristics -- 6. Very Large-Scale Neighborhood Search -- 7. Decomposition Based Heuristics -- 8. Corridor Method -- 9. Kernel Search -- 10. Fore-and-Back.

This book is the first comprehensive tutorial on matheuristics. Matheuristics are based on mathematical extensions of previously known heuristics, mainly metaheuristics, and on original, area-specific approaches. This tutorial provides a detailed discussion of both contributions, presenting the pseudocodes of over 40 algorithms, abundant literature references, and for each case a step-by-step description of a sample run on a common Generalized Assignment Problem example. C++ source codes of all algorithms are available in an associated SW repository.

ISBN: 9783030702779

Standard No.: 10.1007/978-3-030-70277-9doiSubjects--Topical Terms:

1066682
Heuristic algorithms.

LC Class. No.: QA76.9.A43 / M365 2021

Dewey Class. No.: 005.1

Matheuristics = algorithms and implementations /
LDR:02077nmm a2200337 a 4500 001 2239643
003 DE-He213
005 20210723150557.0
006 m d
007 cr nn 008maaau
008 211111s2021 sz s 0 eng d
020 $a 9783030702779 $q (electronic bk.)
020 $a 9783030702762 $q (paper)
024 7 $a 10.1007/978-3-030-70277-9 $2 doi
035 $a 978-3-030-70277-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b M365 2021
072 7 $a KJMV $2 bicssc
072 7 $a BUS087000 $2 bisacsh
072 7 $a KJMV $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b M278 2021
100 1 $a Maniezzo, Vittorio. $3 927918
245 1 0 $a Matheuristics $h [electronic resource] : $b algorithms and implementations / $c by Vittorio Maniezzo, Marco Antonio Boschetti, Thomas Stutzle.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xviii, 214 p. : $b ill., digital ; $c 24 cm.
490 1 $a EURO advanced tutorials on operational research, $x 2364-687X
505 0 $a Part I: Contextual Issues -- 1. The Generalized Assignment Problem -- 2. Automatic Design for Matheuristics -- Part II: Metaheuristic Hybrids -- 3. Single Solution Metaheuristics -- 4. Population-Based metaheuristics -- Part III: Original Matheuristics -- 5. Diving Heuristics -- 6. Very Large-Scale Neighborhood Search -- 7. Decomposition Based Heuristics -- 8. Corridor Method -- 9. Kernel Search -- 10. Fore-and-Back.
520 $a This book is the first comprehensive tutorial on matheuristics. Matheuristics are based on mathematical extensions of previously known heuristics, mainly metaheuristics, and on original, area-specific approaches. This tutorial provides a detailed discussion of both contributions, presenting the pseudocodes of over 40 algorithms, abundant literature references, and for each case a step-by-step description of a sample run on a common Generalized Assignment Problem example. C++ source codes of all algorithms are available in an associated SW repository.
650 0 $a Heuristic algorithms. $3 1066682
650 1 4 $a Operations Management. $2 swd $3 1283589
650 2 4 $a Operations Research, Management Science. $3 1532996
650 2 4 $a Algorithms. $3 536374
650 2 4 $a Mathematical Applications in Computer Science. $3 1567978
650 2 4 $a Optimization. $3 891104
700 1 $a Boschetti, Marco Antonio. $3 3493851
700 1 $a Stutzle, Thomas. $3 753238
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a EURO advanced tutorials on operational research. $3 2156289
856 4 0 $u https://doi.org/10.1007/978-3-030-70277-9
950 $a Business and Management (SpringerNature-41169)