World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
7250
World Ranking
12919
National Ranking
5214

Mathematics

D-Index
31
Citations
7057
World Ranking
3273
National Ranking
1293

Overview

Jon Lee is affiliated with the University of Michigan-Ann Arbor in the United States. Their research spans several fields including Computer Science, Mathematics, and Engineering. Specifically, their work addresses subfields such as Computational Theory and Mathematics, Numerical Analysis, Artificial Intelligence, Computational Mechanics, and Statistics and Probability.

The scientist's research topics focus on areas including Advanced Optimization Algorithms Research, Sparse and Compressive Sensing Techniques, Matrix Theory and Algorithms, Machine Learning and Algorithms, Complexity and Algorithms in Graphs, Optimization and Search Problems, and Advanced Statistical Methods and Models.

Jon Lee has published across a variety of venues, with frequent contributions in arXiv (Cornell University), Mathematical Programming, Discrete Applied Mathematics, Journal of Global Optimization, and INFORMS journal on computing.

Recent published papers include:

  • Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs, 2020, INFORMS journal on computing
  • Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs, 2022, Mathematics of Operations Research
  • Mixing convex-optimization bounds for maximum-entropy sampling, 2021, Mathematical Programming
  • D-Optimal Data Fusion: Exact and Approximation Algorithms, 2023, INFORMS journal on computing
  • On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem, 2023, INFORMS journal on computing

They have collaborated frequently with several co-authors, including Marcia Fampa, Luze Xu, Gabriel Ponte, Zhong-Zhu Chen, and Daphne Skipper.

Jon Lee is also an author of a book published by Springer International Publishing titled "Maximum-Entropy Sampling" (2022).

Best Publications

  • An algorithmic framework for convex mixed integer nonlinear programs

    Pierre Bonami;Lorenz T. Biegler;Andrew R. Conn;GéRard CornuéJols

  • Branching and bounds tighteningtechniques for non-convex MINLP

    Pietro Belotti;Jon Lee;Leo Liberti;Francois Margot

  • Mixed Integer Nonlinear Programming

    Jon Lee;Sven Leyffer

  • An Exact Algorithm for Maximum Entropy Sampling

    Chun-Wa Ko;Jon Lee;Maurice Queyranne

  • Non-monotone submodular maximization under matroid and knapsack constraints

    Jon Lee;Vahab S. Mirrokni;Viswanath Nagarajan;Maxim Sviridenko

  • On the optimal design of water distribution networks: a practical MINLP approach

    Cristiana Bragalli;Claudia D’Ambrosio;Jon Lee;Andrea Lodi

  • Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

    Jon Lee;Maxim Sviridenko;Jan Vondrák

  • Nonlinear Integer Programming

    Raymond Hemmecke;Matthias Köppe;Jon Lee;Robert Weismantel

  • Non-monotone submodular maximization under matroid and knapsack constraints

    Jon Lee;Vahab Mirrokni;Viswanath Nagarjan;Maxim Sviridenko

  • Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

    Jon Lee;Vahab S. Mirrokni;Viswanath Nagarajan;Maxim Sviridenko

  • A First Course in Combinatorial Optimization

    Jon Lee

  • Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations

    Anureet Saxena;Pierre Bonami;Jon Lee

  • Min-up/min-down polytopes

    Jon Lee;Janny Leung;FrançOis Margot

  • Toward online, worldwide access to Vatican Library materials

    F. C. Mintzer;L. E. Boyle;A. N. Cazes;B. S. Christian

  • Constrained Maximum-Entropy Sampling

    Jon Lee

  • Discretization orders for distance geometry problems

    Carlile Lavor;Jon Lee;Audrey Lee-St. John;Leo Liberti

  • Polyhedral methods for piecewise-linear functions I: the lambda method

    Jon Lee;Dan Wilson

  • On convex relaxations of quadrilinear terms

    Sonia Cafieri;Jon Lee;Leo Liberti

  • Water network design by MINLP

    Cristiana Bragalli;Claudia D'Ambrosio;J. Lee;Andrea Lodi

  • Expressing combinatorial problems by systems of polynomial equations and hilbert's nullstellensatz

    J. a. Loera;J. Lee;S. Margulies;S. Onn

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

    Leo Liberti;Benoít Masson;Jon Lee;Carlile Lavor

Frequent Co-Authors

Leo Liberti
Leo Liberti École Polytechnique
Maxim Sviridenko
Maxim Sviridenko Yahoo (United States)
Andrea Lodi
Andrea Lodi Cornell University
Jesús A. De Loera
Jesús A. De Loera University of California, Davis
Paolo Toth
Paolo Toth University of Bologna
Jan Vondrák
Jan Vondrák Stanford University
Carlile Lavor
Carlile Lavor State University of Campinas
Vahab Mirrokni
Vahab Mirrokni Google (United States)
Don Coppersmith
Don Coppersmith IBM (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring mathematics in the USA opens doors to a variety of related online degrees that can enhance career prospects. For those interested in business leadership, an easiest MBA program may offer a flexible pathway to combine quantitative skills with management expertise. These programs often emphasize practical application, making them accessible for students transitioning from math backgrounds.

Another popular option is pursuing an easiest online MBA program. These degrees provide convenience and allow students to balance work, study, and personal commitments while gaining essential business acumen relevant to mathematics professionals.

For individuals aiming to advance further into leadership, the most affordable online DBA programs present a cost-effective way to pursue a Doctor of Business Administration, a degree that blends research with practical business strategies.

Finance is another lucrative pathway for math graduates. Many look into the cheapest online master's in finance to deepen their understanding of financial markets while keeping costs manageable. This specialization supports careers in investment, banking, and financial analysis.

Best Scientists Citing Jon Lee

Trending Scientists

Recently Published Articles