Evolutionary Computation in Combinatorial Optimization (eBook, PDF)
5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings
Redaktion: Raidl, Günther R.; Gottlieb, Jens
40,95 €
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
20 °P sammeln
40,95 €
Als Download kaufen
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
20 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
20 °P sammeln
Evolutionary Computation in Combinatorial Optimization (eBook, PDF)
5th European Conference, EvoCOP 2005, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings
Redaktion: Raidl, Günther R.; Gottlieb, Jens
- Format: PDF
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei
bücher.de, um das eBook-Abo tolino select nutzen zu können.
Hier können Sie sich einloggen
Hier können Sie sich einloggen
Sie sind bereits eingeloggt. Klicken Sie auf 2. tolino select Abo, um fortzufahren.
Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei bücher.de, um das eBook-Abo tolino select nutzen zu können.
- Geräte: PC
- ohne Kopierschutz
- eBook Hilfe
- Größe: 3.39MB
Andere Kunden interessierten sich auch für
- Evolutionary Computation in Combinatorial Optimization (eBook, PDF)40,95 €
- Evolutionary Computation in Combinatorial Optimization (eBook, PDF)40,95 €
- Evolutionary Computation in Combinatorial Optimization (eBook, PDF)40,95 €
- Evolutionary Computation in Combinatorial Optimization (eBook, PDF)40,95 €
- Evolutionary Computation in Combinatorial Optimization (eBook, PDF)40,95 €
- Evolutionary Multi-Criterion Optimization (eBook, PDF)113,95 €
- Hybrid Metaheuristics (eBook, PDF)40,95 €
-
-
-
Produktdetails
- Verlag: Springer Berlin Heidelberg
- Seitenzahl: 271
- Erscheinungstermin: 26. Februar 2005
- Englisch
- ISBN-13: 9783540319962
- Artikelnr.: 44132217
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
Günther R. Raidl, Technische Universität Wien, Vienna, Austria / Jens Gottlieb, SAP AG, Walldorf, Germany
An External Partial Permutations Memory for Ant Colony Optimization.- A Novel Application of Evolutionary Computing in Process Systems Engineering.- Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework.- An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem.- EvoGeneS, a New Evolutionary Approach to Graph Generation.- On the Application of Evolutionary Algorithms to the Consensus Tree Problem.- Analyzing Fitness Landscapes for the Optimal Golomb Ruler Problem.- Immune Algorithms with Aging Operators for the String Folding Problem and the Protein Folding Problem.- Multiobjective Quadratic Assignment Problem Solved by an Explicit Building Block Search Algorithm - MOMGA-IIa.- Lot-Sizing in a Foundry Using Genetic Algorithm and Repair Functions.- Estimation of Distribution Algorithms with Mutation.- Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution.- Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring.- Application of the Grouping Genetic Algorithm to University Course Timetabling.- Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems.- Population Training Heuristics.- Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem.- The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem.- Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator.- Ant Algorithm for the Graph Matching Problem.- An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem.- An Improved Simulated Annealing Method for the Combinatorial Sub-problem of the Profit-Based Unit Commitment Problem.- A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem.- An AgentModel for Binary Constraint Satisfaction Problems.
An External Partial Permutations Memory for Ant Colony Optimization.- A Novel Application of Evolutionary Computing in Process Systems Engineering.- Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework.- An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem.- EvoGeneS, a New Evolutionary Approach to Graph Generation.- On the Application of Evolutionary Algorithms to the Consensus Tree Problem.- Analyzing Fitness Landscapes for the Optimal Golomb Ruler Problem.- Immune Algorithms with Aging Operators for the String Folding Problem and the Protein Folding Problem.- Multiobjective Quadratic Assignment Problem Solved by an Explicit Building Block Search Algorithm - MOMGA-IIa.- Lot-Sizing in a Foundry Using Genetic Algorithm and Repair Functions.- Estimation of Distribution Algorithms with Mutation.- Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution.- Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring.- Application of the Grouping Genetic Algorithm to University Course Timetabling.- Self-Adapting Evolutionary Parameters: Encoding Aspects for Combinatorial Optimization Problems.- Population Training Heuristics.- Scatter Search Particle Filter to Solve the Dynamic Travelling Salesman Problem.- The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem.- Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator.- Ant Algorithm for the Graph Matching Problem.- An Adaptive Genetic Algorithm for the Minimal Switching Graph Problem.- An Improved Simulated Annealing Method for the Combinatorial Sub-problem of the Profit-Based Unit Commitment Problem.- A New Hybrid GA/SA Algorithm for the Job Shop Scheduling Problem.- An AgentModel for Binary Constraint Satisfaction Problems.