Cantitate/Preț
Produs

Evolutionary Computation in Combinatorial Optimization: 6th European Conference, EvoCOP 2006, Budapest, Hungary, April 10-12, 2006, Proceedings: Lecture Notes in Computer Science, cartea 3906

Editat de Jens Gottlieb, Günther R. Raidl
en Limba Engleză Paperback – 24 mar 2006

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 31958 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 21 mar 2005 31958 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 24 mar 2006 32069 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 26 mar 2004 37135 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32069 lei

Preț vechi: 40087 lei
-20% Nou

Puncte Express: 481

Preț estimativ în valută:
6138 6475$ 5115£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540331780
ISBN-10: 3540331786
Pagini: 312
Ilustrații: XII, 296 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.44 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem.- The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling.- Evolving the Structure of the Particle Swarm Optimization Algorithms.- A Tabu Search Algorithm for Optimization of Gas Distribution Networks.- Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm.- Parametrized GRASP Heuristics for Three-Index Assignment.- A Memetic Algorithm with Bucket Elimination for the Still Life Problem.- Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA.- Particle Swarm for the Traveling Salesman Problem.- Hierarchical Cellular Genetic Algorithm.- Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation.- Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach.- A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems.- New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm.- Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems.- A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem.- The Core Concept for the Multidimensional Knapsack Problem.- Multiobjective Scheduling of Jobs with Incompatible Families on Parallel Batch Machines.- A Memetic Algorithm for the Biobjective Minimum Spanning Tree Problem.- A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems.- Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning.- A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems.- An Efficient Hybrid Search Algorithm for Various Optimization Problems.- A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament.

Caracteristici

Includes supplementary material: sn.pub/extras