Machine learning for combinatorial optimization : a methodological tour d'horizon
Year of publication: |
2021
|
---|---|
Authors: | Bengio, Yoshua ; Lodi, Andrea ; Prouvost, Antoine |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 290.2021, 2 (16.4.), p. 405-421
|
Subject: | Branch and bound | Combinatorial optimization | Machine learning | Mixed-integer programming solvers | Künstliche Intelligenz | Artificial intelligence | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
An exact algorithm for the block relocation problem with a stowage plan
Tanaka, Shunji, (2019)
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
-
Naderi, Bahman, (2020)
- More ...
-
Predicting tactical solutions to operational planning problems under imperfect information
Larsen, Eric, (2022)
-
Bengio, Yoshua, (2004)
-
Spectral Dimensionality Reduction
Bengio, Yoshua, (2004)
- More ...