Jon Lee

6.8k total citations · 3 hit papers
172 papers, 3.8k citations indexed

About

Jon Lee is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Numerical Analysis. According to data from OpenAlex, Jon Lee has authored 172 papers receiving a total of 3.8k indexed citations (citations by other indexed papers that have themselves been cited), including 67 papers in Computational Theory and Mathematics, 37 papers in Electrical and Electronic Engineering and 35 papers in Numerical Analysis. Recurrent topics in Jon Lee's work include Advanced Optimization Algorithms Research (35 papers), Advanced Graph Theory Research (27 papers) and Complexity and Algorithms in Graphs (23 papers). Jon Lee is often cited by papers focused on Advanced Optimization Algorithms Research (35 papers), Advanced Graph Theory Research (27 papers) and Complexity and Algorithms in Graphs (23 papers). Jon Lee collaborates with scholars based in United States, Brazil and France. Jon Lee's co-authors include Sven Leyffer, François Margot, Andreas Wächter, Leo Liberti, Pierre Bonami, Andrea Lodi, Maxim Sviridenko, Pietro Belotti, Maurice Queyranne and Ignacio E. Grossmann and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of Applied Physics and Journal of Fluid Mechanics.

In The Last Decade

Jon Lee

159 papers receiving 3.5k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

An algorithmic framework for convex mixed integer nonlinear programs

2007 603 citations Pierre Bonami, Jon Lee et al. Discrete Optimization profile →
Mixed Integer Nonlinear Programming

2011 451 citations Jon Lee et al. profile →
Branching and bounds tighteningtechniques for non-convex MINLP

2009 387 citations Pietro Belotti, Jon Lee et al. Optimization methods & software profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Jon Lee United States	26	1.0k	862	766	706	536	172	3.8k
Hoàng Tụy Vietnam	28	1.7k 1.7×	719 0.8×	975 1.3×	1.8k 2.6×	557 1.0×	98	3.7k
Sven Leyffer United States	28	1.7k 1.6×	892 1.0×	1.6k 2.1×	1.9k 2.6×	396 0.7×	98	4.6k
Leo Liberti France	30	914 0.9×	366 0.4×	588 0.8×	713 1.0×	375 0.7×	166	2.9k
Kazuo Murota Japan	34	1.7k 1.7×	386 0.4×	446 0.6×	656 0.9×	613 1.1×	215	4.1k
Hervé Lebret France	8	616 0.6×	951 1.1×	1.3k 1.7×	623 0.9×	378 0.7×	14	4.2k
Jeff Linderoth United States	24	593 0.6×	593 0.7×	612 0.8×	562 0.8×	587 1.1×	71	2.6k
Daniel Bienstock United States	29	700 0.7×	1.0k 1.2×	515 0.7×	264 0.4×	585 1.1×	124	3.4k
J. B. Rosen United States	27	1.4k 1.3×	287 0.3×	746 1.0×	1.4k 2.0×	299 0.6×	92	3.5k
Narendra Karmarkar United States	16	2.2k 2.1×	702 0.8×	566 0.7×	1.7k 2.4×	922 1.7×	27	4.6k
Jacek Gondzio United Kingdom	29	968 0.9×	318 0.4×	388 0.5×	1.1k 1.5×	218 0.4×	109	2.5k

Countries citing papers authored by Jon Lee

Since Specialization

Citations

This map shows the geographic impact of Jon Lee's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jon Lee with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jon Lee more than expected).

Fields of papers citing papers by Jon Lee

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jon Lee. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jon Lee. The network helps show where Jon Lee may publish in the future.

Co-authorship network of co-authors of Jon Lee

This figure shows the co-authorship network connecting the top 25 collaborators of Jon Lee. A scholar is included among the top collaborators of Jon Lee based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jon Lee. Jon Lee is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Lee, Jon, et al.. (2025). On the hardness of short and sign-compatible circuit walks. Discrete Applied Mathematics. 367. 129–149.

2.

Lee, Jon, et al.. (2023). Tridiagonal maximum-entropy sampling and tridiagonal masks. Discrete Applied Mathematics. 337. 120–138. 2 indexed citations

3.

Li, Yongchun, Marcia Fampa, Jon Lee, et al.. (2023). D-Optimal Data Fusion: Exact and Approximation Algorithms. INFORMS journal on computing. 36(1). 97–120. 1 indexed citations

4.

Lee, Jon, et al.. (2023). On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Mathematical Programming. 206(1-2). 91–124. 1 indexed citations

5.

Ahmed, Shabbir, et al.. (2020). Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs. INFORMS journal on computing. 7 indexed citations

6.

Lee, Jon, et al.. (2019). Generalized maximum-entropy sampling. INFOR Information Systems and Operational Research. 58(2). 168–181. 1 indexed citations

7.

Fampa, Marcia, Jon Lee, & Nelson Maculan. (2015). An overview of exact algorithms for the Euclidean Steiner tree problem in n‐space. International Transactions in Operational Research. 23(5). 861–874. 9 indexed citations

8.

Lee, Jon & Jens Vygen. (2014). Integer programming and combinatorial optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014, proceedings. DIAL (Catholic University of Leuven). 1 indexed citations

9.

Liberti, Leo, Benoît Masson, Jon Lee, Carlile Lavor, & Antonio Mucherino. (2013). On the number of realizations of certain Henneberg graphs arising in protein conformation. Discrete Applied Mathematics. 165. 213–232. 30 indexed citations

10.

Belotti, Pietro, Jon Lee, Leo Liberti, François Margot, & Andreas Wächter. (2009). Branching and bounds tighteningtechniques for non-convex MINLP. Optimization methods & software. 24(4-5). 597–634. 387 indexed citations breakdown →

11.

Kim, Jae Hun, Jon Lee, Kebin Shi, et al.. (2008). Broadband supercontinuum generation covering UV to mid-IR region by using three pumping sources in single crystal sapphire fiber. Optics Express. 16(19). 14792–14792. 12 indexed citations

12.

Bonami, Pierre, et al.. (2007). Rapid development of an open-source MINLP solver with COIN-OR. 75(75). 3 indexed citations

13.

Lee, Jon, et al.. (2004). Trends in Optimization. 2 indexed citations

14.

Lee, Jon, Janny Leung, & François Margot. (2004). Min-up/min-down polytopes. Discrete Optimization. 1(1). 77–85. 60 indexed citations

15.

Anstreicher, Kurt M., et al.. (2001). Maximum-entropy remote sampling. Discrete Applied Mathematics. 108(3). 211–226. 14 indexed citations

16.

Lee, Jon, et al.. (1999). A Characterization of the Orientations of Ternary Matroids. Journal of Combinatorial Theory Series B. 77(2). 263–291. 7 indexed citations

17.

Hayden, T. L., Jon Lee, J. H. Wells, & Pablo Tarazaga. (1996). Block matrices and multispherical structure of distance matrices. Linear Algebra and its Applications. 247. 203–216. 8 indexed citations

18.

Leung, Janny & Jon Lee. (1994). More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Applied Mathematics. 50(2). 185–200. 31 indexed citations

19.

Lee, Jon & Walter D. Morris. (1994). Geometric comparison of combinatorial polytopes. Discrete Applied Mathematics. 55(2). 163–182. 12 indexed citations

20.

Lee, Jon, et al.. (1991). A spectral method for concordant polyhedral faces. Linear Algebra and its Applications. 159. 11–41. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact