An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem

Author:

Liu Huaiyuan1ORCID,Liu Xianzhang1ORCID,Yang Donghua1ORCID,Wang Hongzhi1ORCID,Long Yingchi1ORCID,Ji Mengtong1ORCID,Miao Dongjing1ORCID,Liang Zhiyu1ORCID

Affiliation:

1. Harbin Institute of Technology, Harbin, China

Funder

Science and Technology Project of State Grid: Research on artificial intelligence analysis technology of available transmission capacity (ATC) of the key section under multiple power grid operation modes

Publisher

ACM

Reference52 articles.

1. Saeed Amizadeh, Sergiy Matusevych, and Markus Weimer. 2018. Learning to solve circuit-sat: An unsupervised differentiable approach. In International Conference on Learning Representations.

2. Saeed Amizadeh, Sergiy Matusevych, and Markus Weimer. 2019. PDP: A general neural framework for learning constraint satisfaction solvers. arXiv preprint arXiv:1903.01969 (2019).

3. An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems

4. The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem

5. The MNIST Database of Handwritten Digit Images for Machine Learning Research [Best of the Web]

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3