5 problems

For any $(v_0,v)\in\mathbb{R}^{n+1}$, let $\text{E-CG}(v_0,v)$ denote the corresponding Eigen-CG inequality, and let BH inequalities denote the Boros–Hammer inequalities. Nonnegati…

Let $\text{Eigen-CG}$ denote the family of Eigen-CG inequalities obtained from vectors $(v_0,v)\in\mathbb{R}^{n+1}$, and let $\text{BH}$ denote the family of Boros–Hammer inequalit…

Consider mixed-integer bilevel linear optimization instances classified by their objective alignment, and compare cut-generation performance with and without mixed-integer linear p…

Consider mixed-integer bilevel linear optimization instances with an objective-alignment parameter, and let the cut-generation failure rate denote the proportion of attempted inter…

Mixed-integer bilevel linear optimization problems may use intersection cuts (ICs), including integer disjunctive intersection cuts and integer split intersection cuts, together wi…