Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies

12 February 2020

Papers citing "Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies"

7 / 7 papers shown

Title
Exact Combinatorial Optimization with Graph Convolutional Neural Networks Maxime Gasse Didier Chételat Nicola Ferroni Laurent Charlin Andrea Lodi GNN CML 110 481 0 04 Jun 2019
Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon Yoshua Bengio Andrea Lodi Antoine Prouvost 139 1,367 0 15 Nov 2018
Group Normalization Yuxin Wu Kaiming He 147 3,626 0 22 Mar 2018
CLEVR: A Diagnostic Dataset for Compositional Language and Elementary Visual Reasoning Justin Johnson B. Hariharan Laurens van der Maaten Li Fei-Fei C. L. Zitnick Ross B. Girshick CoGe 275 2,346 0 20 Dec 2016
Deep Reinforcement Learning in Large Discrete Action Spaces Gabriel Dulac-Arnold Richard Evans H. V. Hasselt P. Sunehag Timothy Lillicrap Jonathan J. Hunt Timothy A. Mann T. Weber T. Degris Ben Coppin OffRL 52 573 0 24 Dec 2015
Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling Junyoung Chung Çağlar Gülçehre Kyunghyun Cho Yoshua Bengio 293 12,662 0 11 Dec 2014
DASH: Dynamic Approach for Switching Heuristics G. D. Liberto Serdar Kadioğlu Kevin Leo Y. Malitsky 47 58 0 17 Jul 2013