| Evolutionary
Combinatorial Optimization: Papers
Deceptiveness
and Neutrality—The ND Family of Fitness Landscapes
(Page 507)
W. Beaudoin, S. Vere, P. Collard, C. Escazut (University
of Nice-Sophia Antipolis)
A
New Hybrid Evolutionary Algorithm for the k-cardinality Tree Problem
(Page 515)
C. Blum (Universitàt Politècnica de Catalunya)
Comparison
of Genetic Representation Schemes for Scheduling Soft Real-Time Parallel
Applications
(Page 523)
Y. S. Dandass, A. C. Bugde (Mississippi State University)
GRASP-Evolution
for Constraint Satisfaction Problems
(Page 531)
M. Cebrián, I. Dotú (Universidad Autónoma de Madrid)
Maximum
Cardinality Matchings on Trees by Randomized Local Search
(Page 539)
O. Giel, I. Wegener (Universität Dortmund)
The
Quadratic Multiple Knapsack Problem and Three Heuristic Approaches to
It
(Page 547)
A. Hiley, B. A. Julstrom (St. Cloud State University)
An
Effective Genetic Algorithm for the Minimum-Label Spanning Tree Problem
(Page 553)
J. Nummela (University of Michigan)
B. A. Julstrom (St. Cloud State University)
Anisotropic
Selection in Cellular Genetic Algorithms
(Page 559)
D. Simoncini, S. Verel, P. Collard, M. Clergue (CNRS-Université
de Nice Sophia Antipolis)
How
Randomized Search Heuristics Find Maximum Cliques in Planar Graphs
(Page 567)
T. Storch (University of Dromond)
Adaptation
for Parallel Memetic Algorithm Based on Population Entropy
(Page 575)
J. Tang, M. H. Lim, Y. S. Ong (Nanyang Technological
University)
Combining
Simplex with Niche-based Evolutionary Computation for Job-Shop Scheduling
(Page 583)
S. Kuah, J. C. Tay (Nanyang Technological University)
A
GA-Based Method to Produce Generalized Hyper-heuristics for the 2D-Regular
Cutting Stock Problem
(Page 591)
H. Terashima-Marín, C. J. Farías Zárate (ITESM-Intelligent
Systems)
P. Ross (Napier University)
M. Valenzuela-Rendón (ITESM-Intelligent Systems)
A
GA-ACO-Local Search Hybrid Algorithm for Solving Quadratic Assignment
Problem
(Page 599)
Y.-L. Xu, M.-H. Lim, Y.-S. Ong, J. Tang (Nanyang Technological
University)
Evolutionary
Combinatorial Optimization: Posters
A
Genetic Algorithm for the Longest Common Subsequence Problem
(Page 609)
B. Hinkemeyer, B. A. Julstrom (St. Cloud State University)
A
Combinatorial Genetic Algorithm for the Configuration of the 2dF/AAOmega
Spectrograph at the Anglo-Australian Observatory
(Page 611)
S. Manos, G. Lewis (University of Sydney)
Measuring
the Evolvability Landscape to Study Neutrality
(Page 613)
S. Verel, P. Collard, M. Clergue (University of Nice-Sophia
Antipolis)
Genetic
Local Search for Multicast Routing
(Page 615)
M. S. Zahrani (University of Hertfordshire)
M. J. Loomes (Middlesex University)
J. A. Malcolm, A. A. Albrecht (University of Hertfordshire)
|
