Nature-Inspired Algorithms for Optimisation
☆☆☆☆☆
(0 reviews)
Lowest price (incl. delivery)
28 599,00 JPY
Typical price4 427,45 PLN
Lowest (90 days)179,99 PLN
Offers6
Last updated1週間前
Price history (90 days)
Full history
2026-08-08
2026-08-15
| 更新日時 | 価格 |
|---|---|
| 2026-08-08 | 179,99 |
| 2026-08-15 | 207,99 |
| 販売者 | Product price | Delivery | 合計 | 在庫状況 | Updated | |
|---|---|---|---|---|---|---|
| SP SpringerNatureLink Shop INT | 28 599,00 JPY | free | 28 599,00 JPY | 在庫あり | 5日前 | View offer |
| SP Springer Nature Author | 28 599,00 JPY | 29,00 JPY | 28 628,00 JPY | 在庫あり | 1週間前 | View offer |
| SP SpringerNatureLink Shop INT | 199,99 USD | 15,00 USD | 214,99 USD | 在庫あり | 5日前 | View offer |
| SP SpringerNatureLink Shop INT | 219,99 USD | free | 219,99 USD | 在庫あり | 5日前 | View offer |
| SP SpringerNatureLink Shop INT | 219,99 USD | 25,00 USD | 244,99 USD | 在庫あり | 5日前 | View offer |
| SP SpringerNatureLink Shop INT | 236,00 EUR | 25,00 EUR | 261,00 EUR | 在庫あり | 5日前 | View offer |
価格や在庫状況は変更される場合があります。 最終更新: 08.08.2026 23:38.
0,0
☆☆☆☆☆
0 reviews
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Product reviews
No reviews yet — be the first!
Nature-Inspired Algorithms have been gaining much popularity in recent years due to the fact that many real-world optimisation problems have become increasingly large, complex and dynamic. The size and complexity of the problems nowadays require the development of methods and solutions whose efficiency is measured by their ability to find acceptable results within a reasonable amount of time, rather than an ability to guarantee the optimal solution. This volume 'Nature-Inspired Algorithms for Optimisation' is a collection of the latest state-of-the-art algorithms and important studies for tackling various kinds of optimisation problems. It comprises 18 chapters, including two introductory chapters which address the fundamental issues that have made optimisation problems difficult to solve and explain the rationale for seeking inspiration from nature. The contributions stand out through their novelty and clarity of the algorithmic descriptions and analyses, and lead the way to interesting and varied new applications.