Sciweavers

10493 search results - page 181 / 2099
» Dynamic Word Problems
Sort
View
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 2 months ago
Evolutionary algorithms and multi-objectivization for the travelling salesman problem
This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-obje...
Martin Jähne, Xiaodong Li, Jürgen Branke
IWPEC
2004
Springer
14 years 1 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
KR
2004
Springer
14 years 1 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
CP
1998
Springer
14 years 12 days ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
GECCO
2006
Springer
165views Optimization» more  GECCO 2006»
13 years 12 months ago
Comparing mathematical models on the problem of network inference
In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different mathemat...
Christian Spieth, Nadine Hassis, Felix Streichert