A Deep Learning Algorithm for the Max-Cut Problem Based on Pointer Network Structure with Supervised Learning and Reinforcement Learning Strategies

The Max-cut problem is a well-known combinatorial optimization problem, which has many real-world applications. However, the problem has been proven to be non-deterministic polynomial-hard (NP-hard), which means that exact solution algorithms are not suitable for large-scale situations, as it is too...

Full description

Bibliographic Details
Main Authors: Shenshen Gu, Yue Yang
Format: Article
Language:English
Published: MDPI AG 2020-02-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/8/2/298