Hybrid Metaheuristics 4th International Workshop, HM 2007, Dortmund, Germany, October 8-9, 2007. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Bartz-Beielstein, Thomas (Επιμελητής έκδοσης), Blesa Aguilera, María José (Επιμελητής έκδοσης), Blum, Christian (Επιμελητής έκδοσης), Naujoks, Boris (Επιμελητής έκδοσης), Roli, Andrea (Επιμελητής έκδοσης), Rudolph, Günter (Επιμελητής έκδοσης), Sampels, Michael (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
• Σειρά: Lecture Notes in Computer Science, 4771
• Θέματα: Computer science.; Computers.; Algorithms.; Numerical analysis.; Artificial intelligence.; Pattern recognition.; Computer Science.; Artificial Intelligence (incl. Robotics).; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Numeric Computing.; Pattern Recognition.

Πίνακας περιεχομένων:

• 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.