Translator Disclaimer
9 September 2019 Discrete optimizations using graph convolutional networks
Author Affiliations +
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.
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Radu Balan and Naveed Haghani "Discrete optimizations using graph convolutional networks", Proc. SPIE 11138, Wavelets and Sparsity XVIII, 1113806 (9 September 2019); https://doi.org/10.1117/12.2529432
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
Back to Top