117 citations · 170 across the 8 of their papers we have counts for
8 papers
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić +2
We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-lev…
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
Elisabeth Gaar, Jon Lee, Ivana Ljubić +2
We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We de…
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond
Jesus A. De Loera, Raymond Hemmecke, Jon Lee
Motivated by Bland's linear-programming generalization of the renowned Edmonds-Karp efficient refinement of the Ford-Fulkerson maximum-flow algorithm, we discuss three closely-rela…
Intractability of approximate multi-dimensional nonlinear optimization on independence systems
Jon Lee, Shmuel Onn, Robert Weismantel
We consider optimization of nonlinear objective functions that balance linear criteria over -element independence systems presented by linear-optimization oracles. For …
Non-monotone submodular maximization under matroid and knapsack constraints
Jon Lee, Vahab Mirrokni, Viswanath Nagarjan +1
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hyp…
Nonlinear optimization for matroid intersection and extensions
Yael Berstein, Jon Lee, Shmuel Onn +1
We address optimization of nonlinear functions of the form , where is a nonlinear function, is a matrix, and feasible are in some large fi…