讲座题目：Learn to solve dominating set problem with graph neural networks

讲座时间：2023.11.16（周四）15：00-16：00

讲座地点：腾讯会议:266-403-053

主讲人：何伟骅

主讲内容：

  The idea using neural networks to solve combinatorial optimization problems has been shown to be effective and time-saving in recent years. Inspired by these studies, we train a neural network by DDQN to solve dominating set problem. To better capture the features and structure of the graph, we use a message passing network for the graph representation. We validate our model on graphs of different sizes, and even on real-world networks

主讲人简介：

  何伟骅，博士，副教授，广东工业大学4556银河国际在线副院长，2008年本科毕业于中国科学技术大学，2014年博士毕业于法国巴黎第十一大学，主要从事图论及其应用、组合优化算法、机器学习的研究工作，主持国家自然科学基金和省部级项目多项。