On the Proof Complexity of Linear Programming Based Branch-and-Bound

Maximilian Gläser