Main Page

Proceedings Table of Contents
Companion Table of Contents
Author Index

Track 1: Ant Colony Optimization, Swarm Intelligence, and Artificial Immune Systems
Track 2: Artificial Life, Evolutionary Robotics, Adaptive Behavior, Evolvable Hardware
Track 3: Bioinformatics and Computational Biology
Track 4: Coevolution
Track 5: Estimation of Distribution Algorithms
Track 6: Evolution Strategies, Evolutionary Programming
Track 7: Evolutionary Combinatorial Optimization
Track 8: Evolutionary Multiobjective Optimization
Track 9: Formal Theory
Track 10: Generative and Developmental Systems
Track 11: Genetic Algorithms
Track 12: Genetic Programming
Track 13: Genetics-Based Machine Learning and Learning Classifier Systems
Track 14: Real-World Application
Track 15: Search-based Software Engineering

Table of Contents

Track 7: Evolutionary Combinatorial Optimization

GECCO 2008 Main Proceedings Table of Contents



Crossover Can Provably Be Useful in Evolutionary Computation (Page 539)
Benjamin Doerr (Max-Planck-Institut für Informatik)
Edda Happ (Max-Planck-Institut für Informatik)
Christian Klein (Max-Planck-Institut für Informatik)

Enhancing Solution Quality of the Biobjective Graph Coloring Problem Using Hybridization of EA (Page 547)
Rajeev Kumar (Indian Institute of Technology Kharagpur)
Paresh Tolay (Indian Institute of Technology Kharagpur)
Siddharth Tiwary (Indian Institute of Technology Kharagpur)

A Study of NK Landscapes' Basins and Local Optima Networks (Page 555)
Gabriela Ochoa (University of Nottingham)
Marco Tomassini (University of Lausanne)
Sebástien Vérel (CNRS-University of Nice)
Christian Darabos (University of Lausanne)

Orientation Matters: How to Efficiently Solve OCST Problems with Problem-specific EAs (Page 563)
Wolfgang Steitz (University of Mainz)
Franz Rothlauf (University of Mainz)

Hyper-heuristics for the Dynamic Variable Ordering in Constraint Satisfaction Problems (Page 571)
H. Terashima-Marín (Tecnológico de Monterrey)
J. C. Ortiz-Bayliss (Tecnológico de Monterrey)
P. Ross (Napier University)
M. Valenzuela-Rendón (Tecnológico de Monterrey)

An Iterated Greedy Algorithm for the Node Placement Problem in Bidirectional Manhattan Street Networks (Page 579)
Fubito Toyama (Utsunomiya University)
Kenji Shoji (Utsunomiya University)
Juichi Miyamichi (Utsunomiya University)

Understanding Elementary Landscapes (Page 585)
L. Darrell Whitley (Colorado State University)
Andrew M. Sutton (Colorado State University)
Adele E. Howe (Colorado State University)

Feasibility-Preserving Crossover for Maximum k-Coverage Problem (Page 593)
Yourim Yoon (Seoul National University)
Yong-Hyuk Kim (Kwangwoon University)
Byung-Ro Moon (Seoul National University)

(Return to Top)


Distributed Problem Solving by Memetic Networks (Page 599)
Ricardo M. Araujo (Federal University of Rio Grande do Sul)
Luis C. Lamb (Federal University of Rio Grande do Sul)

Evolving Heuristics with Genetic Programming (Page 601)
Mohamed BaderElDen (University of Essex)
Riccardo Poli (University of Essex)

A Parallel Evolutionary Algorithm for Unconstrained Binary Quadratic Problems (Page 603)
István Borgulya (University of Pécs)

A Tabu History Driven Crossover Operator Design for Memetic Algorithm Applied to Max-2SAT-Problems (Page 605)
Markus Borschbach (University of Münster)
Andre Exeler (University of Southampton)

An Evolutionary Algorithm for Some Cases of the Single-Source Constrained Plant Location Problem (Page 607)
Bryant A. Julstrom (St. Cloud State University)

Subheuristic Search and Scalability in a Hyperheuristic (Page 609)
Robert E. Keller (University of Essex)
Riccardo Poli (University of Essex)

Greedy Heuristics and Evolutionary Algorithms for the Bounded Minimum-Label Spanning Tree Problem (Page 611)
Arindam Khaled (St. Cloud State University)
Bryant A. Julstrom (St. Cloud State University)

A Multi-Start Quantum-Inspired Evolutionary Algorithm for Solving Combinatorial Optimization Problems (Page 613)
Parvaz Mahdabi (Tarbiat Modares University)
Saeed Jalili (Tarbiat Modares University)
Mahdi Abadi (Tarbiat Modares University)

Complexity of MAX-SAT Using Stochastic Algorithms (Page 615)
Mohamed Qasem (University of Southampton)
Adam Prugel-Bennett (University of Southampton)