MétaCan
← all works

Machine learning for combinatorial optimization: A methodological tour d'horizon

2021· article· en· 1,336 citations· W3047863327 on OpenAlex· 10.1016/j.ejor.2020.07.063

Why is this work in the frame?

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

Canadian affiliationAn author listed a Canadian institution. This is the only route the usual frame has.

Machine scores (provisional)

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Opus teacher head0.029
GPT teacher head0.249
Teacher spread
0.220 · how far apart the two teachers sit on this one work
Validation status
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Abstract

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.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

The record

Venue
Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)
Topic
Scheduling and Optimization Algorithms
Field
Engineering
Canadian institutions
Université de MontréalPolytechnique MontréalMila - Quebec Artificial Intelligence Institute
Funders
Keywords
Computer scienceHeuristicsArtificial intelligenceMachine learningCombinatorial optimizationPoint (geometry)Task (project management)Optimization problemMathematical optimizationOnline machine learningActive learning (machine learning)MathematicsAlgorithm
Has abstract in OpenAlex
yes