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...
Gespeichert in:
| Veröffentlicht in: | International Conference on Intelligent Control and Information Processing (Online) S. 144 - 151 |
|---|---|
| Hauptverfasser: | , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
08.03.2024
|
| Schlagworte: | |
| ISSN: | 2835-9577 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!