26 citations · 106 across the 18 of their papers we have counts for
21 papers
On the Combinatorial Diameters of Parallel and Series Connections
Steffen Borgwardt, Weston Grewe, Jon Lee
The investigation of combinatorial diameters of polyhedra is a classical topic in linear programming due to its connection with the possibility of an efficient pivot rule for the s…
Gaining or Losing Perspective for Convex Multivariate Functions on a Simplex
Luze Xu, Jon Lee
MINLO (mixed-integer nonlinear optimization) formulations of the disjunction between the origin and a polytope via a binary indicator variable have broad applicability in nonlinear…
Polynomial upper bounds on the number of differing columns of -modular integer programs
Jon Lee, Joseph Paat, Ingo Stallknecht +1
We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showe…
Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions
Jon Lee, Daphne Skipper, Emily Speakman +1
We study MINLO (mixed-integer nonlinear optimization) formulations of the disjunction , where is a binary indicator of (),…
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…
Gaining or losing perspective
Jon Lee, Daphne Skipper, Emily Speakman
We study MINLO (mixed-integer nonlinear optimization) formulations of the disjunction , where is a binary indicatorof (), and "…