5 citations · 12 across the 8 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022
Compressing Branch-and-Bound Trees
Gonzalo Muñoz, Joseph Paat, Álinson S. Xavier
A branch-and-bound (BB) tree certifies a dual bound on the value of an integer program. In this work, we introduce the tree compression problem (TCP): Given a BB tree T that certif…
math.OC2022★ 1 cited
Exploiting Instance and Variable Similarity to Improve Learning-Enhanced Branching
Xiaoyi Gu, Santanu S. Dey, Álinson S. Xavier +1
In many operational applications, it is necessary to routinely find, within a very limited time window, provably good solutions to challenging mixed-integer linear programming (MIL…