You have Guest access.
Log In
Peter Cowling and Peter Merz
Front matter
1-10
Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling
11-22
Heuristic and Exact Methods for the Discrete (r |p)-Centroid Problem
23-34
On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme
35-46
A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study
47-58
Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems
59-70
A Genetic Algorithm to Minimize Chromatic Entropy
71-82
Evolutionary Approaches to the Three-dimensional Multi-pipe Routing Problem: A Comparative Study Using Direct Encodings
83-94
A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks
95-106
Ant Colony Optimization for Tree Decompositions
107-118
Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times
119-130
Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures
131-142
Characterizing Fault-Tolerance of Genetic Algorithms in Desktop Grid Systems
143-153
The Office-Space-Allocation Problem in Strongly Hierarchized Organizations
154-165
A Study of Memetic Search with Multi-parent Combination for UBQP
166-177
Bicriteria Scheduling Problem on the Two-Machine Flowshop Using Simulated Annealing
178-189
A Memetic Algorithm for Workforce Distribution in Dynamic Multi-Skill Call Centres
190-201
Geometric Generalization of the Nelder-Mead Algorithm
202-213
Guided Ejection Search for the Pickup and Delivery Problem with Time Windows
214-225
An Evolutionary Algorithm Guided by Preferences Elicited According to the ELECTRE TRI Method Principles
226-238
Multilevel Variable Neighborhood Search for Periodic Routing Problems
239-251
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
252-263
A New Primal-Dual Genetic Algorithm: Case Study for the Winner Determination Problem
264-275
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem
276-287
Efficient Cycle Search for the Minimum Routing Cost Spanning Tree 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