A Method for Large Scale Unconstrained Binary Quadratic Programming Problem Based on Graph Neural Network

In recent years, the advantages of Graph Neural Networks (GNNs) in solving complex combinatorial optimization problems have become more and more obvious. Under this background, this paper demonstrates a method based on GNNs to solve large-scale Unconstrained 0-1 Quadratic Programming (UBQP) problems...

Full description

Saved in:
Bibliographic Details
Published in:International Conference on Intelligent Control and Information Processing (Online) pp. 144 - 151
Main Authors: Huang, Jiajia, Gu, Shenshen
Format: Conference Proceeding
Language:English
Published: IEEE 08.03.2024
Subjects:
ISSN:2835-9577
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first