Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	März 2004
Genre:	Schulbücher
	Algorithm Analysis and Problem Complexity / Algorithmen und Datenstrukturen / Algorithms / Algorithms & data structures / C / Combinatorics / Combinatorics & graph theory / Computation by Abstract Devices / computer science / Computer science—Mathematics / Computers / Discrete Mathematics / Discrete Mathematics in Computer Science / Diskrete Mathematik / Mathematical optimization / Mathematical theory of computation / Mathematik für Informatiker / Maths for computer scientists / Numeric Computing / Numerical analysis / Numerische Mathematik / Optimization / Theoretische Informatik / Theory of Computation mehr...
ISBN:	9783540213673
EAN-Code:	9783540213673
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#3004 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D 13 mm
Gewicht:	800 gr
Seiten:	241
Illustration:	X, 241 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

EvoCOP Contributions.- Mutation Multiplicity in a Panmictic Two-Strategy Genetic Algorithm.- Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms.- Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem.- A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem.- AntPacking - An Ant Colony Optimization Approach for the One-Dimensional Bin Packing Problem.- Scatter Search and Memetic Approaches to the Error Correcting Code Problem.- A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem.- Parallel Ant Systems for the Capacitated Vehicle Routing Problem.- A Hierarchical Social Metaheuristic for the Max-Cut Problem.- On the Structure of Sequential Search: Beyond "No Free Lunch".- Dealing with Solution Diversity in an EA for Multiple Objective Decision Support - A Case Study.- A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems.- Binary Merge Model Representation of the Graph Colouring Problem.- Hardness Prediction for the University Course Timetabling Problem.- Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem.- On the Use of Path Relinking for the ? - Hub Median Problem.- Solving a Real-World Glass Cutting Problem.- Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair Heuristic.- Improving Vehicle Routing Using a Customer Waiting Time Colony.- New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms.- Improving Edge Recombination through Alternate Inheritance and Greedy Manner.- Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic Algorithm.- On Search Space Symmetry inPartitioning Problems.