Atjaunināt sīkdatņu piekrišanu

Evolutionary Computation in Combinatorial Optimization: 18th European Conference, EvoCOP 2018, Parma, Italy, April 46, 2018, Proceedings 2018 ed. [Mīkstie vāki]

  • Formāts: Paperback / softback, 189 pages, height x width: 235x155 mm, weight: 454 g, 31 Illustrations, black and white; XIV, 189 p. 31 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 10782
  • Izdošanas datums: 03-Mar-2018
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319774484
  • ISBN-13: 9783319774480
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 189 pages, height x width: 235x155 mm, weight: 454 g, 31 Illustrations, black and white; XIV, 189 p. 31 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 10782
  • Izdošanas datums: 03-Mar-2018
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319774484
  • ISBN-13: 9783319774480

This book constitutes the refereed proceedings of the 18th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2018, held in Parma, Italy, in April 2018, co-located with the Evo* 2018 events EuroGP, EvoMUSART and EvoApplications.

 The 12 revised full papers presented were carefully reviewed and selected from 37 submissions. The papers cover a wide spectrum of topics, ranging from the foundations of evolutionary computation algorithms and other search heuristics, to their accurate design and application to both single- and multi-objective combinatorial optimization problems. Fundamental and methodological aspects deal with runtime analysis, the structural properties of fitness landscapes, the study of metaheuristics core components, the clever design of their search principles, and their careful selection and configuration by means of automatic algorithm configuration and hyper-heuristics. Applications cover conventional academic domains such as NK landscapes, binary quadratic programming, traveling salesman, vehicle routing, or scheduling problems, and also include real-world domains in clustering, commercial districting and winner determination.