找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Optimization by GRASP; Greedy Randomized Ad Mauricio G.C. Resende,Celso C. Ribeiro Textbook 2016 Springer Science+Business Media New York 2

[復(fù)制鏈接]
查看: 47452|回復(fù): 48
樓主
發(fā)表于 2025-3-21 17:03:01 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Optimization by GRASP
副標(biāo)題Greedy Randomized Ad
編輯Mauricio G.C. Resende,Celso C. Ribeiro
視頻videohttp://file.papertrans.cn/704/703237/703237.mp4
概述First book on GRASP, an optimization technique that has been used all over the world by engineers, optimization specialists, scientists, and more.Includes a how-to guide on designing efficient and eff
圖書(shū)封面Titlebook: Optimization by GRASP; Greedy Randomized Ad Mauricio G.C. Resende,Celso C. Ribeiro Textbook 2016 Springer Science+Business Media New York 2
描述.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 GRASPand 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 algorit
出版日期Textbook 2016
關(guān)鍵詞GRASP; GRASP optimization; combinatorial optimization; discrete mathematics; metaheuristics; Greedy Rando
版次1
doihttps://doi.org/10.1007/978-1-4939-6530-4
isbn_softcover978-1-4939-8227-1
isbn_ebook978-1-4939-6530-4
copyrightSpringer Science+Business Media New York 2016
The information of publication is updating

書(shū)目名稱Optimization by GRASP影響因子(影響力)




書(shū)目名稱Optimization by GRASP影響因子(影響力)學(xué)科排名




書(shū)目名稱Optimization by GRASP網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Optimization by GRASP網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Optimization by GRASP被引頻次




書(shū)目名稱Optimization by GRASP被引頻次學(xué)科排名




書(shū)目名稱Optimization by GRASP年度引用




書(shū)目名稱Optimization by GRASP年度引用學(xué)科排名




書(shū)目名稱Optimization by GRASP讀者反饋




書(shū)目名稱Optimization by GRASP讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:11:20 | 只看該作者
板凳
發(fā)表于 2025-3-22 00:25:05 | 只看該作者
地板
發(fā)表于 2025-3-22 07:37:06 | 只看該作者
GRASP: The basic heuristic,i-greedy multistart procedures and show how solutions produced by both procedures differ. The hybridization of a semi-greedy procedure with a local search method constitutes a GRASP heuristic. The chapter concludes with some implementation details, including stopping criteria.
5#
發(fā)表于 2025-3-22 08:50:12 | 只看該作者
Case studies,s are for 2-path network design, graph planarization, unsplittable multicommodity flows, and maximum cut in a graph. The key point here is not to show numerical results or compare these GRASP heuristics with other approaches, but instead simply show how to customize the GRASP metaheuristic for each particular problem.
6#
發(fā)表于 2025-3-22 15:10:48 | 只看該作者
http://image.papertrans.cn/o/image/703237.jpg
7#
發(fā)表于 2025-3-22 18:15:46 | 只看該作者
8#
發(fā)表于 2025-3-22 21:29:59 | 只看該作者
Mauricio G. C. Resende,Celso C. RibeiroRealit?t, die physikalische Wirklichkeit, an. Das ist aber fast nirgends so weit gefehlt wie bei der Analyse unserer Fortbewegung. Hier schon zu Beginn und im Weiteren kann modernes Herumbewegen von Personen und Waren nur erkl?rt werden, wenn die Bilder und Vorstellungen in den K?pfen der Menschen i
9#
發(fā)表于 2025-3-23 05:14:20 | 只看該作者
10#
發(fā)表于 2025-3-23 07:38:50 | 只看該作者
Introduction,number of fundamental combinatorial optimization problems that will be revisited along the next chapters of this book. We also contrast exact and approximate solution methods and trace a brief history of approximate algorithms (or heuristics) from A. to metaheuristics, going through greedy algorithm
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 12:39
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
龙陵县| 雅江县| 崇阳县| 康马县| 吉林省| 宁阳县| 巩义市| 长寿区| 改则县| 永胜县| 子长县| 抚州市| 廉江市| 抚远县| 天水市| 图木舒克市| 罗山县| 砀山县| 凉山| 都江堰市| 政和县| 和静县| 庆云县| 屯留县| 兴文县| 瓦房店市| 宁阳县| 灵山县| 育儿| 同江市| 磐石市| 九龙城区| 濮阳市| 招远市| 横山县| 正宁县| 化州市| 宜昌市| 伊宁市| 揭东县| 甘泉县|