My Account Log in

1 option

Hybrid Metaheuristics : 4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings / edited by Thomas Bartz-Beielstein, Maria J. Blesa, Christian Blum, Boris Naujoks, Andrea Roli, Günther Rudolph, Michael Sampels.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Bartz-Beielstein, Thomas, editor.
Blesa, María J., editor.
Blum, C. (Christian), editor.
Naujoks, Boris, editor.
Roli, Andrea, editor.
Rudolph, Günther, editor.
Sampels, Michael, 1969- editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4771.
Theoretical Computer Science and General Issues ; 4771
Language:
English
Subjects (All):
Artificial intelligence.
Algorithms.
Computers.
Numerical analysis.
Pattern perception.
Artificial Intelligence.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Numeric Computing.
Pattern Recognition.
Local Subjects:
Artificial Intelligence.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Numeric Computing.
Pattern Recognition.
Physical Description:
1 online resource (X, 201 pages).
Edition:
First edition 2007.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
System Details:
text file PDF
Contents:
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 and 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.
Other Format:
Printed edition:
ISBN:
978-3-540-75514-2
9783540755142
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account