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

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

This thesis investigates the proof system associated to the branch-and-bound method for linear integer programming, that is, we treat branch-and-bound trees as proofs of the integer-freeness of certain polyhedra (equivalently, of the infeasibility of integer linear programs).

  • Gläser, Maximillian
  • 2024-11-11