Atjaunināt sīkdatņu piekrišanu

Evolutionary Computation in Combinatorial Optimization: 19th European Conference, EvoCOP 2019, Held as Part of EvoStar 2019, Leipzig, Germany, April 2426, 2019, Proceedings 1st ed. 2019 [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 213 pages, height x width: 235x155 mm, weight: 454 g, 34 Illustrations, color; 23 Illustrations, black and white; XIV, 213 p. 57 illus., 34 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 11452
  • Izdošanas datums: 28-Mar-2019
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030167100
  • ISBN-13: 9783030167103
  • 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, 213 pages, height x width: 235x155 mm, weight: 454 g, 34 Illustrations, color; 23 Illustrations, black and white; XIV, 213 p. 57 illus., 34 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 11452
  • Izdošanas datums: 28-Mar-2019
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030167100
  • ISBN-13: 9783030167103

This book constitutes the refereed proceedings of the 19th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2019, held as part of Evo* 2019, in Leipzig, Germany, in April 2019, co-located with the Evo* 2019 events EuroGP, EvoMUSART and EvoApplications.

The 14 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. Applications cover domains such as scheduling, routing, partitioning and general graph problems.