359 search results - page 46 / 72 » A Hybrid Genetic Algorithm for the Quadratic Assignment Prob... |
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
ISDA
2008
IEEE
14 years 3 months ago
2008
IEEE
Both simulated annealing (SA) and the genetic algorithms (GA) are stochastic and derivative-free optimization technique. SA operates on one solution at a time, while the GA mainta...
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract- The complexity of the static scheduling problem on heterogeneous resources has motivated the development of low complexity heuristics such as list scheduling. However, th...
EVOW
2004
Springer
14 years 2 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...