|  |
 |
| Artikel-Nr.: 5667A-9783540755135 Herst.-Nr.: 9783540755135 EAN/GTIN: 9783540755135 |
| |
|
|  |  |
 | Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem.- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem.- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems.- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP.- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem.- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop.- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy.- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case.- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement.- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge.- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric.- A Hybrid VNS for Connected Facility Location.- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem.- Hybrid Numerical Optimization for Combinatorial Network Problems. Weitere Informationen:  |  | Author: | Thomas Bartz-Beielstein; Maria J. Blesa; Christian Blum; Boris Naujoks; Andrea Roli; Günther Rudolph; Michael Sampels | Verlag: | Springer Berlin | Sprache: | eng |
|
|  |  |
 | |  |  |
 | Weitere Suchbegriffe: allgemeine Informatikbücher - englischsprachig, allgemeine informatikbücher - englischsprachig, Algorithmus, Innovation, Intelligenz / Künstliche Intelligenz, KI, Künstliche Intelligenz - AI, Constraint Satisfaction, algorithmics, algorithms, ant colony optimization, approximation algorithms, clustering search |
|  |  |
| |