5 citations · 12 across the 8 of their papers we have counts for
5 papers · 1 filter
Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data
Berkay Becu, Santanu S. Dey, Feng Qiu +1
Many operations related optimization problems involve repeatedly solving similar mixed integer linear programming (MILP) instances with the same constraint matrix but differing obj…
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…
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…
Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization
Alinson S. Xavier, Feng Qiu, Santanu S. Dey
One of the most complicating factors in decentralized optimization for power systems is the modeling of power flow equations. Existing formulations for DC power flows either have l…
Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
Alinson S. Xavier, Feng Qiu, Shabbir Ahmed
Security-Constrained Unit Commitment (SCUC) is a fundamental problem in power systems and electricity markets. In practical settings, SCUC is repeatedly solved via Mixed-Integer Li…