|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Thomas Bartz-Beielstein , Maria J. Blesa , Christian Blum , Boris NaujoksPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2007 ed. Volume: 4771 Dimensions: Width: 15.50cm , Height: 1.10cm , Length: 23.50cm Weight: 0.454kg ISBN: 9783540755135ISBN 10: 3540755136 Pages: 201 Publication Date: 28 September 2007 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsEvolutionary 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |