Performance of a genetic algorithm for the graph partitioning problem

DOI10.1016/S0895-7177(03)90134-8zbMath1067.90161OpenAlexW2093802669MaRDI QIDQ596896

Kengo Katayaman, Hiroyuki Narihisa, Keiko Kohmoto

Publication date: 6 August 2004

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(03)90134-8

zbMATH Keywords

Genetic algorithmSimulated annealingstrategyGraph partitioningExperimental comparisonLocal searchMultistart local search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Optimization by Simulated Annealing
• A branch-and-cut algorithm for the equicut problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• An Efficient Heuristic Procedure for Partitioning Graphs
• Genetic algorithm and graph partitioning

This page was built for publication: Performance of a genetic algorithm for the graph partitioning problem