Export Reviews, Discussions, Author Feedback and Meta-Reviews

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The paper present a heuristic for node selection in Branch and Bound for Mixed Integer Programs based on machine learning. Although machine learning used for node selection is not new the paper present a new approach (to the best of my knowledge). They utilize a classifier together with an oracle for training two aspects: a node selection policy and a node pruning policy. The first one is used to enforce a linear order/priority on the current open nodes of the Branch and Bound while the second one is used to further shrink the list of open nodes by pruning the unpromising ones.