2018 (modified: 11 Nov 2022)ICML 2018Readers: Everyone
Abstract:Tree search algorithms, such as branch-and-bound, are the most widely used tools for solving combinatorial problems. These algorithms recursively partition the search space to find an optimal solut...