Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...