A machine learning-based approximation of strong branching
Year of publication: |
2017
|
---|---|
Authors: | Marcos Alvarez, Alejandro ; Louveaux, Quentin ; Wehenkel, Louis A. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 29.2017, 1, p. 185-195
|
Subject: | branch and bound | variable branching | strong branching | supervised machine learning | Künstliche Intelligenz | Artificial intelligence | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Filiale | Branch office | Bankenaufsicht | Banking supervision |
-
Improving strong branching by domain propagation
Gamrath, Gerald, (2014)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
-
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Yang, Yu, (2022)
- More ...
-
Batch mode reinforcement learning based on the synthesis of artificial trajectories
Fonteneau, Raphael, (2013)
-
Scenario trees and policy selection for multistage stochastic programming using machine learning
Defourny, Boris, (2013)
-
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
LOUVEAUX, Quentin,
- More ...