.png){kind=icon}
返回
Machine learning for combinatorial optimization: A methodological tour d'horizon
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2020.07.063.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper surveys the recent attempts, both from the machine learning and operations research communities, at leveraging machine learning to solve combinatorial optimization problems. Given the hard nature of these problems, state-of-the-art algorithms rely on handcrafted heuristics for making decisions that are otherwise too expensive to compute or mathematically not well defined. Thus, machine learning looks like a natural candidate to make such decisions in a more principled and optimized way. We advocate for pushing further the integration of machine learning and combinatorial optimization and detail a methodology to do so. A main point of the paper is seeing generic optimization problems as data points and inquiring what is the relevant distribution of problems to use for learning on a given task. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimization
Machine learning
Branch and bound
Mixed-integer programming solvers
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
The Alkaloid Compound Harmane Increases the Lifespan of Caenorhabditis elegans during Bacterial Infection, by Modulating the Nematode’s Innate Immune Response.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏分享收藏ICT for informal workers in Sub-Saharan Africa: Systematic review and analysis撒哈拉以南非洲非正规工人的信通技术: 系统回顾和分析
PREAI
分享收藏
查看更多内容