论文标题
在图形上学习组合优化：一项针对网络应用的调查
Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networking
论文作者
论文摘要
在图表上解决组合优化问题的现有方法遭受着需要以每种问题为单位来设计每个问题的方法，并且在许多情况下会出现实际问题。然后需要解决理论计算机科学的实际方面，例如计算复杂性。为此，对机器学习研究中的相关发展进行了调查。我们组织和比较了学习解决组合优化问题所涉及的结构，并特别关注电信领域及其不断发展的实时和研究网络。
Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances. The practical side of theoretical computer science, such as computational complexity, then needs to be addressed. Relevant developments in machine learning research on graphs are surveyed for this purpose. We organize and compare the structures involved with learning to solve combinatorial optimization problems, with a special eye on the telecommunications domain and its continuous development of live and research networks.
