Evolutionary Computation in Combinatorial Optimization
☆☆☆☆☆
(0 opinii)
Najniższa cena (z dostawą)
6 889,00 JPY
Typowa cena395,87 PLN
Najniższa (90 dni)22,79 PLN
Liczba ofert3
Ostatnia aktualizacja19 godzin temu
Historia ceny (90 dni)
Pełna historia
2026-08-07
2026-08-08
| Zaktualizowano | Cena |
|---|---|
| 2026-08-07 | 22,79 |
| 2026-08-08 | 48,00 |
| Sprzedawca | Cena produktu | Dostawa | Razem | Dostępność | Aktualizacja | |
|---|---|---|---|---|---|---|
| SP Springer Nature Author | 6 864,00 JPY | 25,00 JPY | 6 889,00 JPY | Dostępny | 7 godzin temu | Zobacz ofertę |
| VI VitalSource | 50,28 EUR | 15,00 EUR | 65,28 EUR | Dostępny | 1 dzień temu | Zobacz ofertę |
| SP SpringerNatureLink Shop INT | 57,00 EUR | 19,00 EUR | 76,00 EUR | Dostępny | 19 godzin temu | Zobacz ofertę |
Ceny i dostępność mogą ulec zmianie. Ostatnia aktualizacja: 08.08.2026 11:12.
EAN
9783319164670
Springer Nature
0,0
☆☆☆☆☆
0 opinii
5★
0%
4★
0%
3★
0%
2★
0%
1★
0%
Opinie o produkcie
Brak opinii — bądź pierwszy!
This book constitutes the refereed proceedings of the 15th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2015, held in Copenhagen, Denmark, in April 2015, co-located with the Evo*2015 events EuroGP, EvoMUSART and EvoApplications. The 19 revised full papers presented were carefully reviewed and selected from 46 submissions. The papers cover methodology, applications and theoretical studies. The methods included evolutionary and memetic (hybrid) algorithms, iterated local search, variable neighbourhood search, ant colony optimization, artificial immune systems, hyper-heuristics and other adaptive approaches. The applications include both traditional domains, such as graph coloring, knapsack, vehicle routing, job-shop scheduling, the p-median and the orienteering problems; and new(er) domains such as designing deep recurrent neural networks, detecting network community structure, lock scheduling of ships, cloud resource management, the fire-fighter problem and AI planning. The theoretical studies involved approximation ratio, runtime and black-box complexity analyses.