Jon Lee

发表

On feasibility based bounds tightening

Leo Liberti, P. Belotti, S. Cafieri, 2012 .

On the composition of convex envelopes for quadrilinear terms

Sonia Cafieri, Leo Liberti, Pietro Belotti, 2013 .

A Polytope for a Product of Real Linear Functions in 0/1 Variables

Oktay Günlük, Jon Lee, Janny M. Y. Leung, 2012 .

On feasibility based bounds tightening 0

P. Belotti, S. Cafieri, Jon Lee, 2012 .

D S ] 2 5 N ov 2 01 5 Max-Cut under Graph Constraints

V. Nagarajan, Jon Lee, Xiangkun Shen, 2018 .

On feasibility based bounds tightening 0

P. Belotti, S. Cafieri, Jon Lee, 2012 .

O C ] 1 7 D ec 2 01 5 ANOTHER PEDAGOGY FOR PURE-INTEGER GOMORY

Jon Lee, Qi-Mei He, 2018 .

Polynomial upper bounds on the number of differing columns of $\Delta$-modular integer programs

Jon Lee, Joseph Paat, Luze Xu, 2021, 2105.08160.

Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations

Jon Lee, Daphne E. Skipper, Emily Speakman, 2018, Mathematical Programming.

Polynomial upper bounds on the number of differing columns of $\Delta$-modular integer programs

Jon Lee, Joseph Paat, Luze Xu, 2021, 2105.08160.

Techniques for Submodular Maximization

Jon Lee, Jon Lee, 2013 .

Optimal rank-sparsity decomposition

Jon Lee, Bai Zou, Jon Lee, 2014, J. Glob. Optim..

Approximating graph-constrained max-cut

Xiangkun Shen, Viswanath Nagarajan, Jon Lee, 2018, Math. Program..

Weak orientability of matroids and polynomial equations

Jesús A. De Loera, Jon Lee, J. Miller, 2013, Eur. J. Comb..

Improving Proximity Bounds Using Sparsity

Joseph Paat, Jon Lee, Ingo Stallknecht, 2020, ISCO.

The quadratic Graver cone, quadratic integer minimization, and extensions

Jon Lee, Robert Weismantel, Shmuel Onn, 2010, Math. Program..

On the number of realizations of certain Henneberg graphs arising in protein conformation

Leo Liberti, Antonio Mucherino, Carlile Lavor, 2014, Discret. Appl. Math..

Approximating Max-Cut under Graph-MSO Constraints

Martin Koutecký, Xiangkun Shen, Viswanath Nagarajan, 2018, Oper. Res. Lett..

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility

Jesús A. De Loera, Jon Lee, Susan Margulies, 2008, ISSAC '08.

Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs

Jon Lee, Joseph Paat, Luze Xu, 2022, Mathematics of Operations Research.

Extended Formulations for Independence Polytopes of Regular Matroids

Volker Kaibel, Matthias Walter, Jon Lee, 2015, Graphs Comb..

Systems of Polynomials for Detecting Orientable Matroids

Jesús A. De Loera, Jon Lee, Susan Margulies, 2013, Electron. Notes Discret. Math..

Polynomial upper bounds on the number of differing columns of an integer program

Jon Lee, Luze Xu, Ingo Stallknecht, 2021 .

On an SDP relaxation for kissing number

Leo Liberti, Jon Lee, Jon Lee, 2020, Optim. Lett..

Handling Separable Non-convexities Using Disjunctive Cuts

Claudia D'Ambrosio, Dimitri Thomopulos, Jon Lee, 2020, ISCO.

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz

Jesús A. De Loera, Jon Lee, Susan Margulies, 2011, J. Symb. Comput..

Another pedagogy for pure-integer Gomory

Qi He, Jon Lee, Jon Lee, 2015, RAIRO Oper. Res..

Discretization orders for distance geometry problems

Leo Liberti, Maxim Sviridenko, Antonio Mucherino, 2012, Optim. Lett..

On the Combinatorial Diameters of Parallel and Series Connections

S. Borgwardt, Jon Lee, W. Grewe, 2022, 2203.09587.

On Proximity for k-Regular Mixed-Integer Linear Optimization

Jon Lee, Luze Xu, Jon Lee, 2019, WCGO.

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz

Jesús A. De Loera, Jon Lee, Shmuel Onn, 2009, Combinatorics, Probability and Computing.

Max-Cut Under Graph Constraints pdf

Xiangkun Shen, Viswanath Nagarajan, Jon Lee, 2015, IPCO.

Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions pdf

Jon Lee, Luze Xu, Emily Speakman, 2020, Journal of Optimization Theory and Applications.

On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem

Leo Liberti, Jon Lee, A. Mucherino, 2010, International Conference on Combinatorial Optimization and Applications.

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility

J. D. Loera, Jon Lee, P. Malkin, 2008, ISSAC '08.

Feasibility-Based Bounds Tightening via Fixed Points

Sonia Cafieri, Leo Liberti, Pietro Belotti, 2010, COCOA.