2 citations · 3 across the 4 of their papers we have counts for
Showing 2023 · math.OCShow all
2 papers · 2 filters
math.OC2023
Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization
Gérard Cornuéjols, Yatharth Dubey
In this paper, we consider a theoretical framework for comparing branch-and-bound with classical lift-and-project hierarchies. We simplify our analysis of streamlining the definiti…
math.OC2023★ 1 cited
On the Smallest Support Size of Integer Solutions to Linear Equations
Yatharth Dubey, Siyue Liu
In this note, we study the size of the support of integer solutions to linear equations where . We give an upper bound on the smalle…