Jon Lee
Orcid: 0000-0002-8190-1091Affiliations:
- University of Michigan, Deptartment of Industrial and Operations Engineering, Ann Arbor, MI, USA
- IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
- University of Kentucky, Department of Mathematics, Lexington, KY, USA
- Yale University, New Haven, CT, USA
- Cornell University, Ithaca, NY, USA
According to our database1,
Jon Lee
authored at least 135 papers
between 1989 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
Math. Program., July, 2024
J. Glob. Optim., June, 2024
SIAM J. Discret. Math., March, 2024
Oper. Res., 2024
Discret. Appl. Math., 2024
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
2023
Discret. Appl. Math., October, 2023
Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions.
J. Optim. Theory Appl., 2023
INFORMS J. Comput., 2023
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023
2022
Proceedings of the Integer Programming and Combinatorial Optimization, 2022
2021
Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search.
SIAM J. Optim., 2021
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses.
Open J. Math. Optim., 2021
J. Glob. Optim., 2021
J. Glob. Optim., 2021
INFORMS J. Comput., 2021
2020
An R Package for Generating Covariance Matrices for Maximum-Entropy Sampling from Precipitation Chemistry Data.
Oper. Res. Forum, 2020
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs.
Optim. Lett., 2020
Graphs Comb., 2020
Discret. Appl. Math., 2020
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020
2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
2018
Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations.
Math. Program., 2018
On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation.
J. Glob. Optim., 2018
Discret. Appl. Math., 2018
2017
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017
2016
An overview of exact algorithms for the Euclidean Steiner tree problem in <i>n</i>-space.
Int. Trans. Oper. Res., 2016
Graphs Comb., 2016
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in <i>n</i>-space.
Comput. Optim. Appl., 2016
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016
Proceedings of the Integer Programming and Combinatorial Optimization, 2016
2015
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond.
SIAM J. Optim., 2015
Electron. Notes Discret. Math., 2015
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015
2014
On the number of realizations of certain Henneberg graphs arising in protein conformation.
Discret. Appl. Math., 2014
2013
ACM J. Exp. Algorithmics, 2013
INFORMS Trans. Educ., 2013
Electron. Notes Discret. Math., 2013
2012
Math. Program., 2012
Math. Methods Oper. Res., 2012
2011
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations.
Math. Program., 2011
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz.
J. Symb. Comput., 2011
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011
Proceedings of the Combinatorial Optimization and Applications, 2011
2010
SIAM J. Discret. Math., 2010
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization.
Math. Program. Comput., 2010
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations.
Math. Program., 2010
Parametric nonlinear discrete optimization over well-described sets and matroid intersections.
Math. Program., 2010
Math. Oper. Res., 2010
Intractability of approximate multi-dimensional nonlinear optimization on independence systems.
CoRR, 2010
On the Convergence of Feasibility based Bounds Tightening.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
Proceedings of the Combinatorial Optimization and Applications, 2010
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010
2009
SIAM J. Discret. Math., 2009
Optim. Methods Softw., 2009
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz.
Comb. Probab. Comput., 2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity.
Proceedings of the Algorithms, 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
Proceedings of the Algorithmic Aspects in Information and Management, 2009
2008
Discret. Optim., 2008
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2007
IBM J. Res. Dev., 2007
2006
Proceedings of the Algorithms, 2006
2005
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation.
J. Comb. Optim., 2005
Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.
Ann. Oper. Res., 2005
2004
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
2003
Math. Program., 2003
2002
2001
Discret. Appl. Math., 2001
Proceedings of the Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), 2001
1999
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems.
Math. Program., 1999
1998
Ann. Oper. Res., 1998
1997
1996
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
1994
Discret. Appl. Math., 1994
1993
1992
1990
Math. Oper. Res., 1990
J. Comb. Theory B, 1990
Discret. Appl. Math., 1990
1989