Generalized cycle crossover for graph partitioning

13 years 8 months ago

Download eden.dei.uc.pt

We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems obtaining excellent results. Categories and Subject Descriptors: G.2.3 [Mathematics of Computing]: DISCRETE MATHEMATICS

Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun

Real-time Traffic

Cycle Crossover | GECCO 2006 | Graph Partitioning Problems | Optimization | Suits Partition Problems |

claim paper

» A Memetic Algorithm for the Generalized Minimum VertexBiconnected Network Problem

» A note on generalized chromatic number and generalized girth

» Fast estimation of the partitioning rent characteristic using a recursive partitioning mod...

» Decomposing Berge graphs and detecting balanced skew partitions

» An SPQRTree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

» On the superconnectivity of generalized pcycles

» Acyclic dominating partitions

» A General Approximation Technique for Constrained Forest Problems

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2006
Where	GECCO
Authors	Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon, Riccardo Poli

Comments (0)

Sciweavers

Generalized cycle crossover for graph partitioning

Cycle Crossover | GECCO 2006 | Graph Partitioning Problems | Optimization | Suits Partition Problems |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers