121
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
120
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper we discuss Evolution Strategies within the context of interactive optimization. Different modes of interaction will be classified and compared. A focus will...
123
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
145
Voted
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
114
click to vote
EVOW
2006
Springer
15 years 7 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...