.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Combinatorial optimization
Machine learning
Branch and bound
Mixed-integer programming solvers
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
ShareSaveThe 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
OAAIShareSaveShareSaveShareSave
View more