14 citations · 30 across the 20 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.OC2020
Constructing lattice-free gradient polyhedra in dimension two
Joseph Paat, Miriam Schlöter, Emily Speakman
Lattice-free gradient polyhedra can be used to certify optimality for mixed-integer convex minimization models. We consider how to construct these polyhedra for unconstrained model…
math.OC2020★ 1 cited
Improving proximity bounds using sparsity
Jon Lee, Joseph Paat, Ingo Stallknecht +1
We refer to the distance between optimal solutions of integer programs and their linear relaxations as proximity. In 2018, Eisenbrand and Weismantel proved that proximity is indepe…