48 search results - page 2 / 10 » Simulated Annealing for Graph Bisection |
EVOW
2001
Springer
13 years 9 months ago
2001
Springer
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
PPAM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
ACMSE
1999
ACM
13 years 9 months ago
1999
ACM
EOR
2008
13 years 5 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
GECCO
2009
Springer
13 years 10 months ago
2009
Springer
Automatic design of software architecture by use of genetic algorithms has already been shown to be feasible. A natural problem is to augment – if not replace – genetic algori...