2018/05/04 by Hyejin Kim, Kim, Hye-Jin, Yong-Hyuk Kim +1
Computer Science · Engineering · #Constraint Satisfaction and Optimization #Embedded Systems Design Techniques #FOS: Computer and information sciences #Neural and Evolutionary Computing (cs.NE) #VLSI and FPGA Design Techniques
paper · pdf · doi:10.48550/arxiv.1805.01623
openalex publication_date 2018/05/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The graph partitioning problem (GPP) is a representative combinatorial optimization problem which is NP-hard. Currently, various approaches to solve GPP have been introduced. Among these, the GPP solution using evolutionary computation (EC) is an effective approach. There has not been any survey on the research applying EC to GPP since 2011. In this survey, we introduce various attempts to apply EC to GPP made in the recent seven years.