Evolcomp

Eine generische Bibliothek für Metaheuristiken und ihre Anwendung auf das Quadratic Assignment Problem

Exact and Heuristic Methods for Solving the Car Sequencing Problem

Matthias Prandtstetter

An Application of Dijkstra's Algorithm for a (On-Board) Route (Re-)Planning Module

Grégoire Verlut

An Extended Local Branching Framework and its Application to the Multidimensional Knapsack Problem

Daniel Lichtenberger

Option Pricing by Means of Genetic Programming

A Variable Neighborhood Search Approach for Solving the Car Sequencing Problem

Matthias Prandtstetter, Günther Raidl

Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification

Jakob Puchinger, Günther Raidl

Cooperating Memetic and Branch-and-Cut Algorithms for Solving the Multidimensional Knapsack Problem

Jakob Puchinger, Günther Raidl, Martin Gruber

Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Günther Raidl, Jens Gottlieb

Evolutionary Computation in Combinatorial Optimization -- EvoCOP~2005