Fetching the paper…
Reading the bibliography…
Most combinatorial optimization problems can be formulated as mixed integer linear programming (MILP), in which branch-and-bound (B\&B) is a general and widely used method.
Experiments in mixed-integer linear programming
M. Benichou, J. M. Gauthier, P. Girodet, G. Hentges, G. Ribiere, and O. Vincent · 1971
Earlier work this paper cites.
Finding cuts in the tsp
D Applegate, R Bixby, V Chvátal, and W Cook · 1995
Earlier work this paper cites.
Branching rules revisited
Tobias Achterberg, Thorsten Koch, and Alexander Martin · 2005
Earlier work this paper cites.
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
Jagat Patel and John W Chinneck · 2007
Earlier work this paper cites.
A supervised machine learning approach to variable branching in branch-and-bound
Alejandro Marcos Alvarez, Quentin Louveaux, and Louis Wehenkel · 2014
Earlier work this paper cites.
A supervised machine learning approach to variable branching in branch-and-bound
Marcos Alvarez, Alejandro, Quentin Louveaux, and Louis Wehenkel · 2014
Earlier work this paper cites.
Learning to branch in mixed integer programming
Elias Khalil, Pierre Le Bodic, Le Song, George Nemhauser, and Bistra Dilkina · 2016
Cited alongside, same era.
Deep reinforcement learning with double q-learning
Hado Van Hasselt, Arthur Guez, and David Silver · 2016
Cited alongside, same era.
Learning to branch
MF Balcan, T Dick, T Sandholm, and E Vitercik · 2018
Cited alongside, same era.
Exact combinatorial optimization with graph convolutional neural networks
Maxime Gasse, Didier Chételat, Nicola Ferroni, Laurent Charlin, and Andrea Lodi · 2019
Cited alongside, same era.
Reinforcement learning for variable selection in a branch and bound algorithm
Marc Etheve, Zacharie Alès, Côme Bissuel, Olivier Juan, and Safia Kedad-Sidhoum · 2020
Cited alongside, same era.
Hybrid models for learning to branch
Prateek Gupta, Maxime Gasse, Elias B Khalil, M Pawan Kumar, Andrea Lodi, and Yoshua Bengio · 2020
Later among the works it cites.
Ecole: A gym-like library for machine learning in combinatorial optimization solvers
Antoine Prouvost, Justin Dumouchelle, Lara Scavuzzo, Maxime Gasse, Didier Chételat, and Andrea Lodi · 2020
Later among the works it cites.
Improving learning to branch via reinforcement learning
Haoran Sun, Wenbo Chen, Hui Li, and Le Song · 2020
Later among the works it cites.
Branch and bound in mixed integer linear programming problems: A survey of techniques and trends
Lingying Huang, Xiaomeng Chen, Wei Huo, Jiazheng Wang, Fan Zhang, Bo Bai, and Ling Shi · 2021
Later among the works it cites.
Machine learning for combinatorial optimization, https://www.ecole.ai/2021/ml4co-competition/ ,, 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
NeurIPS 2021 Competition · 2021
Later among the works it cites.