Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
Our paper concerns optimal combinations of different types of reinsurance contracts. We introduce a novel approach based on the Mean-Variance-Criterion to solve this task. Two sta...
Ingo Oesterreicher, Andreas Mitschele, Frank Schlo...
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
David Berger, Bernard Gendron, Jean-Yves Potvin, S...
Evolutionary computation is a generic term used to make reference to the solution of computational problems planned and implemented based on models of an evolutionary process. Most...