Matheuristics
☆☆☆☆☆
(0 reviews)
Lowest price (incl. delivery)
17 174,00 JPY
Typical price681,06 PLN
Lowest (90 days)41,99 PLN
Offers12
Last updated6일 전
Price history (90 days)
Full history
2026-08-08
2026-08-15
| 업데이트 일시 | 가격 |
|---|---|
| 2026-08-08 | 50,18 |
| 2026-08-15 | 41,99 |
| 판매자 | Product price | Delivery | 합계 | 재고 여부 | Updated | |
|---|---|---|---|---|---|---|
| SP SpringerNatureLink Shop INT | 17 159,00 JPY | 15,00 JPY | 17 174,00 JPY | 구매 가능 | 6일 전 | View offer |
| SP Springer Nature Author | 17 159,00 JPY | 29,00 JPY | 17 188,00 JPY | 구매 가능 | 1주 전 | View offer |
| SP SpringerNatureLink Shop INT | 119,99 USD | 19,00 USD | 138,99 USD | 구매 가능 | 6일 전 | View offer |
| SP SpringerNatureLink Shop INT | 129,99 USD | free | 129,99 USD | 구매 가능 | 6일 전 | View offer |
| SP SpringerNatureLink Shop INT | 129,99 USD | 29,00 USD | 158,99 USD | 구매 가능 | 6일 전 | View offer |
| SP SpringerNatureLink Shop INT | 142,00 EUR | 25,00 EUR | 167,00 EUR | 구매 가능 | 6일 전 | View offer |
| SP SpringerNatureLink Shop INT | 219,99 USD | free | 219,99 USD | 구매 가능 | 6일 전 | View offer |
| SP SpringerNatureLink Shop INT | 219,99 USD | 15,00 USD | 234,99 USD | 구매 가능 | 6일 전 | View offer |
| SP SpringerNatureLink Shop INT | 219,99 USD | 19,00 USD | 238,99 USD | 구매 가능 | 6일 전 | View offer |
| SP SpringerNatureLink Shop INT | 249,99 USD | 19,00 USD | 268,99 USD | 구매 가능 | 6일 전 | View offer |
| SP SpringerNatureLink Shop INT | 249,99 USD | 25,00 USD | 274,99 USD | 구매 가능 | 6일 전 | View offer |
| SP SpringerNatureLink Shop INT | 241,99 EUR | 19,00 EUR | 260,99 EUR | 구매 가능 | 6일 전 | View offer |
가격과 재고 여부는 변경될 수 있습니다. 마지막 업데이트: 15.08.2026 07:17.
0,0
☆☆☆☆☆
0 reviews
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Product reviews
No reviews yet — be the first!
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.