The max-cut problem is one of the classic NP-hard combinatorial optimization problems. In order to solve this problem efficiently, the paper mainly studies the topic of using the pointer network to build a training model to solve the max-cut problem. Then, the network model is trained with supervised learning. The experimental results show that the network trained by this algorithm can obtain the approximate solution to the max-cut problem.
CITATION STYLE
Gu, S., & Yang, Y. (2018). A pointer network based deep learning algorithm for the max-cut problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11301 LNCS, pp. 238–248). Springer Verlag. https://doi.org/10.1007/978-3-030-04167-0_22
Mendeley helps you to discover research relevant for your work.