Fetching the paper…
Reading the bibliography…
In line with the growing trend of using machine learning to help solve combinatorial optimisation problems, one promising idea is to improve node selection within a mixed integer programming (MIP) branch-and-bound tree by using a learned policy.
An automatic method of solving discrete programming problems
Land, A.H.; Doig, A.G · 1960
Earlier work this paper cites.
Experiments in mixed-integer linear programming
Bénichou, M.; Gauthier, J.; Girodet, P.; Hentges, G.; Ribière, G.; Vincent, O · 1971
Earlier work this paper cites.
Finding Cuts in the TSP (A Preliminary Report) ;
Applegate, D.; Bixby, R.; Chvátal, V.; Cook, W · 1995
Earlier work this paper cites.
Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies
Zarpellon, G.; Jo, J.; Lodi, A.; Bengio, Y · 2002
Earlier work this paper cites.
Branching rules revisited
Achterberg, T.; Koch, T.; Martin, A · 2004
Earlier work this paper cites.
Extremely randomized trees
Geurts, P.; Ernst, D.; Wehenkel, L · 2006
Earlier work this paper cites.
Training linear SVMs in linear time
Joachims, T · 2006
Earlier work this paper cites.
Constraint Integer Programming
Achterberg, T · 2007
Earlier work this paper cites.
Constraint Integer Programming: A New Approach to Integrate CP and MIP
Achterberg, T.; Berthold, T.; Koch, T.; Wolter, K · 2008
Earlier work this paper cites.
Hybrid Branching
Achterberg, T.; Berthold, T · 2009
Cited alongside, same era.
Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers
Prouvost, A.; Dumouchelle, J.; Scavuzzo, L.; Gasse, M.; Chételat, D.; Lodi, A · 2011
Cited alongside, same era.
Solving Mixed Integer Programs Using Neural Networks
Nair, V.; Bartunov, S.; Gimeno, F.; von Glehn, I.; Lichocki, P.; Lobov, I.; O’Donoghue, B.; Sonnerat, N.; Tjandraatmadja, C.; Wang, P.; et al · 2012
Cited alongside, same era.
Making a Science of Model Search: Hyperparameter Optimization in Hundreds of Dimensions for Vision Architectures
Bergstra, J.; Yamins, D.; Cox, D.D · 2013
Cited alongside, same era.
Learning to Search in Branch and Bound Algorithms
He, H.; Daumé III, H.; Eisner, J · 2014
Cited alongside, same era.
Empirical decision model learning
Lombardi, M.; Milano, M.; Bartolini, A · 2017
Later among the works it cites.
On learning and branching: A survey
Lodi, A.; Zarpellon, G · 2017
Later among the works it cites.
The SCIP Optimization Suite 6.0 ;
Gleixner, A.; Bastubbe, M.; Eifler, L.; Gally, T.; Gamrath, G.; Gottwald, R.L.; Hendel, G.; Hojny, C.; Koch, T.; Lübbecke, M.E.; et al · 2018
Later among the works it cites.
Exact Combinatorial Optimization with Graph Convolutional Neural Networks
Gasse, M.; Chételat, D.; Ferroni, N.; Charlin, L.; Lodi, A · 2019
Later among the works it cites.
PyTorch: An Imperative Style, High-Performance Deep Learning Library
Paszke, A.; Gross, S.; Massa, F.; Lerer, A.; Bradbury, J.; Chanan, G.; Killeen, T.; Lin, Z.; Gimelshein, N.; Antiga, L.; et al · 2019
Later among the works it cites.
Machine learning for combinatorial optimization: A methodological tour d’horizon
Bengio, Y.; Lodi, A.; Prouvost, A · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A supervised machine learning approach to variable branching in branch-and-bound
Alvarez, A.M.; Louveaux, Q.; Wehenkel, L · 2014
Cited alongside, same era.
Adam: A Method for Stochastic Optimization
Kingma, D.P.; Ba, J · 2015
Cited alongside, same era.
Learning to branch in mixed integer programming
Khalil, E.B.; Le Bodic, P.; Song, L.; Nemhauser, G.; Dilkina, B · 2016
Cited alongside, same era.
A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty
Bayliss, C.; Maere, G.D.; Atkin, J.A.D.; Paelinck, M · 2017
Cited alongside, same era.
Closest in time.
Hybrid Models for Learning to Branch
Gupta, P.; Gasse, M.; Khalil, E.B.; Mudigonda, P.K.; Lodi, A.; Bengio, Y · 2020
Closest in time.
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Yang, Y.; Boland, N.; Dilkina, B.; Savelsbergh, M · 2020
Closest in time.
Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction
Ding, J.; Zhang, C.; Shen, L.; Li, S.; Wang, B.; Xu, Y.; Song, L · 2020
Closest in time.