You have Guest access.
Log In
Carlos Cotta and Jano van Hemert
Front matter
3-19
An Evolutionary Algorithm for the Solution of Two-Variable Word Equations in Partially Commutative Groups
21-35
Determining Whether a Problem Characteristic Affects Heuristic Performance A Rigorous Design of Experiments Approach
37-52
Performance and Scalability of Genetic Algorithms on NK-Landscapes
53-66
Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem
69-85
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
87-99
A Hybrid Optimization Framework for Cutting and Packing Problems Case Study on Constrained 2D Non-guillotine Cutting
101-112
A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem
113-129
A Memetic-Neural Approach to Discover Resources in P2P Networks
133-150
An Iterative Heuristic Algorithm for Tree Decomposition
151-166
Search Intensification in Metaheuristics for Solving the Automatic Frequency Problem in GSM
167-184
Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem
187-202
Different Codifications and Metaheuristic Algorithms for the Resource Renting Problem with Minimum and Maximum Time Lags
203-218
A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
219-239
Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids
243-258
Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges
259-274
Algorithms for Large Directed Capacitated Arc Routing Problem Instances Urban Solid Waste Collection Operational Support
275-294
An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
295-307
A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info