Mathematical Programming Solver Based on Local Search

Mathematical Programming Solver Based on Local Search

Frédéric Gardi, Thierry Benoist, Julien Darlay, Bertrand Estellon, Romain Megel
你有多喜歡這本書?
文件的質量如何?
下載本書進行質量評估
下載文件的質量如何?
This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kin.
Abstract: This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kin
年:
2014
版本:
1
出版商:
Wiley-ISTE
語言:
english
頁數:
112
ISBN 10:
1848216866
ISBN 13:
9781306958295
系列:
Focus series in computer engineering
文件:
PDF, 1.88 MB
IPFS:
CID , CID Blake2b
english, 2014
線上閱讀
轉換進行中
轉換為 失敗

最常見的術語