Back to Search
Start Over
Discrete optimizations using graph convolutional networks
- Source :
- Wavelets and Sparsity XVIII.
- Publication Year :
- 2019
- Publisher :
- SPIE, 2019.
-
Abstract
- In this paper we discuss the use of graph deep learning in solving quadratic assignment problems (QAP). The quadratic assignment problem is an NP hard optimization problem. We shall analyze an approach using Graph Convolutional Networks (GCN). We prove that a specially designed GCN produces the optimal solution for a broad class of assignment problems. By appropriate training, the class of problems correctly solved is thus enlarged. Numerical examples compare this method with other simpler methods.
Details
- Database :
- OpenAIRE
- Journal :
- Wavelets and Sparsity XVIII
- Accession number :
- edsair.doi...........58d14210392b316a631694d67d899e83