The Proceedings of HM 2007 are available as in the Lecture Notes in Computer Science series by Springer as LNCS 4771. The online version is available via Springerlink.

We proudly announce the following invited speakers for HM2007.

Catherine C. McGeoch
is a professor of computer science at Amherst College, MA.

Thomas Stützle
is a research associate at the Université Libre de Bruxelles, BE.

8.00 - 9.00	HM 2007 Organization	Reception Desk
9.00 - 9.15	Günter Rudolph	Opening
9.15 - 10.00	Invited Speaker: Thomas Stützle	Stochastic Local Search Engineering
10.00 - 10.30	Steffen Wolf, Peter Merz	Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem
10.30 - 11.00	break
11.00 - 11.30	Mourad Boudia, Christian Prins, Mohamed Reghioui Hamzaoui	An effective memetic algorithm with population management for the split delivery vehicle routing problem
11.30 - 12.00	Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold, Andreas Reinholz	Empirical Analysis of two different Metaheuristics for Real World Vehicle Routing Problems
12.00 - 12.30	Marc Reimann	Guiding ACO by Problem Relaxation: A case study on the symmetric TSP
12.30 - 14.30	lunch
14.30 - 15.00	Igor Pesek, Andrea Schaerf, Janez Zerovnik	Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
15.00 - 15.30	Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz Antonio Nogueira Lorena	Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
15.30 - 16.00	Alexandre Duarte, Celso Ribeiro, Sebastian Urrutia	A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy
16.00 - 16.30	break
16.30 - 17.00	Rhydian Lewis	The Symbiotic Relationship between Constraint Programming and Stochastic Search: The Sudoku Case
17.00 - 17.30	Prasanna Balaprakash, Mauro Birattari, Thomas Stützle	Improvement Strategies for the F-Race algorithm: Sampling Design and Iterative Refinement
20.00 - 23.00	Conference Dinner

9.00 - 9.45	Invited Speaker: Catherine C. McGeoch	Graphical and nonparametric methods for data analysis
9.45 - 10.15	Christian Blum, Monaldo Mastrolilli	Using branch & bound concepts in construction based metaheuristics: Exploiting the dual problem knowledge
10.15 - 10.45	Michael Emmerich, Andre Deutz, Nicola Beume	EMO-Gradient Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric
10.45 - 11.15	break
11.15 - 11.45	Ivana Ljubic	A Hybrid VNS for Connected Facility Location
11.45 - 12.15	Thomas Fischer, Peter Merz	A Memetic Algorithm for the Optimal Communication Spanning Tree Problem
12.15 - 12.45	Markus Chimani, Maria Kandyba, Mike Preuss	Hybrid Numerical Optimization for Combinatorial Network Problems
12.45 - 13.00	HM Organization	Closing
13.00 - 15.00	lunch
15.00 - 17.00	excursion