Cantitate/Preț
Produs
Total produse
Vezi coșul
Evolutionary Computation in Combinatorial Optimization: 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20–22, 2022, Proceedings de Leslie Pérez Cáceres

Evolutionary Computation in Combinatorial Optimization: 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20–22, 2022, Proceedings: Lecture Notes in Computer Science, cartea 13222

Editat de Leslie Pérez Cáceres, Sébastien Verel
en Limba Engleză Paperback – 4 apr 2022
This book constitutes the refereed proceedings of the 22nd European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2022, held as part of Evo*2022, in Madrid, Spain, during April 20-21, 2022, co-located with the Evo*2022 events: EvoMUSART, EvoApplications, and EuroGP.

The 13 revised full papers presented in this book were carefully reviewed and selected from 28 submissions. They present recent theoretical and experimental advances in combinatorial optimization, evolutionary algorithms, and related research fields.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 64187 lei

Preț vechi: 80233 lei
-20% Nou

Puncte Express: 963
Preț estimativ în valută:
12285€ • 12777$ • 10295£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031041471
ISBN-10: 303104147X
Pagini: 209
Ilustrații: XIV, 209 p. 46 illus., 28 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.32 kg
Ediția:1st ed. 2022
Editura: Springer International Publishing
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

On Monte Carlo Tree Search for Weighted Vertex Coloring.- A RNN-based Hyper-heuristic for combinatorial problems.- Algorithm Selection for the Team Orienteering Problem.- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances.- Deep Infeasibility Exploration Method for Vehicle Routing Problems.- Evolutionary Algorithms for the Constrained Two-Level Role Mining Problem.- Simplifying Dispatching Rules in Genetic Programming for Dynamic Job Shop Scheduling.- Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems.- A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation.- Modeling the Costas Array Problem in QUBO for Quantum Annealing.- Penalty Weights in QUBO formulations: Permutation Problems.- PUBOi: a tunable benchmark with variable importance.- Stagnation Detection meets Fast Mutation.