Open AccessParameterizing Branch-and-Bound Search Trees to Learn Branching Policies
Author(s) -
Giulia Zarpellon,
Jason Jo,
Andrea Lodi,
Yoshua Bengio
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v35i5.16512
Subject(s) - branching (polymer chemistry) , generalization , branch and bound , computer science , tree (set theory) , benchmark (surveying) , search tree , integer programming , mathematical optimization , theoretical computer science , artificial intelligence , mathematics , search algorithm , algorithm , combinatorics , mathematical analysis , materials science , geodesy , composite material , geography
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom