1. Jon Lee. Turán's triangle theorem and binary matroids. European Journal of Combinatorics, 10(1):85-90, 1989.

2. Jon Lee. Subspaces with well-scaled frames. Linear Algebra and its Applications, 114/115: 21-56, 1989.

3. Jon Lee. The incidence structure of subspaces with well-scaled frames. Journal of Combinatorial Theory, Series B, 50(2):265-287, 1990.

4. Jon Lee. A spectral approach to polyhedral dimension. Mathematical Programming, Series A, 47(3):441-459, 1990.

5. Jon Lee. Canonical equation sets for classes of concordant polytopes. Discrete Applied Mathematics, 28(3):207-221, 1990.

6. Jon Lee. Characterizations of the dimension for classes of concordant polytopes. Mathematics of Operations Research, 15(1):139-154, 1990.

7. Jon Lee, Yew Sing Lee. A spectral method for concordant polyhedral faces. Linear Algebra and its Applications, 159:11-41, 1991.

8. Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford. Crashing a maximum-weight complementary basis. Mathematical Programming, Series A, 54(3):281-294, 1992.

9. Imre Bárány, Jon Lee, Martin Shubik. Classification of two-person ordinal bimatrix games. International Journal of Game Theory, 21(3):267-290, 1992.

10. Jon Lee. On constrained bottleneck extrema. Operations Research, 40:813-814, 1992.

11. Jon Lee, Jennifer Ryan. Matroid applications and algorithms. ORSA (now INFORMS) Journal on Computing, 4(1):70-98, 1992.

12. Brenda L. Dietrich, Jon Lee, Yew Sing Lee. Order selection on a single machine with high set-up costs. Annals of Operations Research, 43(1-4):379-396, 1993.

13. Jon Lee, Janny Leung. A comparison of two edge-coloring formulations. Operations Research Letters, 13(4):215-223, 1993.

14. Jon Lee, Walter D. Morris, Jr. Geometric comparison of combinatorial polytopes. Discrete Applied Mathematics, 55(2):163-182, 1994.

15. Jon Lee, Jennifer Ryan. Local bipartite Turan graphs and graph partitioning. Networks, 24(3):131-145, 1994.

16. Janny Leung, Jon Lee. More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Applied Mathematics, 50(2):185-200, 1994.

17. Chun-Wa Ko, Jon Lee, Maurice Queyranne. An exact algorithm for maximum entropy sampling. Operations Research, 43(4):684-691, 1995.

18. T.L. Hayden, Jon Lee, Jim Wells, P. Tarazaga. Block matrices and multispherical structure of distance matrices. Linear Algebra and its Applications, 247:203-216, 1996.

19. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. Continuous relaxations for constrained maximum-entropy sampling. In: "Integer Programming and Combinatorial Optimization (Vancouver, BC, 1996)", volume 1084 of Lecture Notes in Computer Science, pages 234-248. Springer, Berlin, 1996.

20. Chun-Wa Ko, Jon Lee, Einar Steingrímsson. The volume of relaxed Boolean-quadric and cut polytopes. Discrete Mathematics, 163(1-3):293-298, 1997.

21. Jon Lee. Hoffman's circle untangled. SIAM Review, 39(1):98-105, 1997.

22. Jill Hardin, Jon Lee, Janny Leung. On the Boolean-quadric packing uncapacitated facility-location polytope. Annals of Operations Research, 83:73-94, 1998.

23. Jon Lee. Discussion on: `A state-space-model approach to optimal spatial sampling design based on entropy'. Environmental and Ecological Statistics, 5:45-46, 1998.

24. Chun-Wa Ko, Jon Lee, Kevin Wayne. Comparison of spectral and Hadamard bounds for D-optimality. In: A.C. Atkinson, L. Pronzato, H.P. Wynn, editors, "MODA 5 - Advances in Model-Oriented Data Analysis and Experimental Design", Contributions to Statistics. Springer, Berlin, 21-29, 1998.

25. Jon Lee. Constrained maximum-entropy sampling. Operations Research, 46:655-664, 1998.

26. Jon Lee. Semidefinite programming in experimental design. In: H. Wolkowicz, R. Saigal, L. Vandenberghe, editors, "Handbook of Semidefinite Programming", International Series in Operations Research and Management Science, Vol. 27, Kluwer, 2000.

27. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Mathematical Programming, Series A, 85:221-240, 1999.

28. Jon Lee, Matt Scobee. A characterization of the orientations of ternary matroids. Journal of Combinatorial Theory, Series B, 77:263-291, 1999.

29. Jon Lee. Orienting matroids representable over both GF(3) and GF(5). European Journal of Combinatorics, 20:833-838, 1999.

30. Jon Lee, Dan Wilson. Polyhedral methods for piecewise-linear functions I: The lambda method. Discrete Applied Mathematics, 108:269-285, 2001.

31. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. Maximum-entropy remote sampling. Discrete Applied Mathematics, 108:211-226, 2001.

32. Jon Lee. Maximum entropy sampling. In A.H. El-Shaarawi, W.W. Piegorsch, editors, “Encyclopedia of Environmetrics”, Volume 3, pp 1229-1234. John Wiley & Sons Ltd, Chichester, UK, 2001. Article updated in “Encyclopedia of Environmetrics,  Second Edition”, pp.1570-1574, 2012.

33. Alan Hoffman, Jon Lee, Joy Williams. New upper bounds for maximum-entropy sampling. In: A.C. Atkinson, P. Hackl, W. G. Müller, editors, "MODA 6 - Advances in Model-Oriented Design and Analysis", Contributions to Statistics, Springer, Berlin, 143-153, 2001.

34. Jon Lee, Joy Williams. Generalized maximum-entropy sampling. INFOR: Information Systems and Operational Research, 58(2):168-181, 2020. 

35. Don Coppersmith, Jon Lee, Janny Leung. A polyhedron for products of linear functions in 0/1 variables. IBM Research Report RC21568, September 1999. Revised with Oktay Gunluk in: "Mixed Integer Nonlinear Programming", S. Leyffer and J. Lee, Eds., The IMA Volumes in Mathematics and its Applications, Vol. 154. 1st Edition, 2012, pp. 513-529.

36. Don Coppersmith, Jon Lee. Indivisibility and divisibility polytopes. In: "Novel Approaches to Hard Discrete Optimization" (P.M. Pardalos, H. Wolkowicz, Editors), Fields Institute Communications Series, Volume 37, American Mathematical Society, 2003, pp. 71-95.

37. Jon Lee, Janny Leung. On the Boolean quadric forest polytope. INFOR Journal, 42(2):125-141, 2004.

38. Jon Lee. Cropped cubes. Journal of Combinatorial Optimization, 7:169-178, 2003.

39. Jon Lee, Joy Williams. A linear integer programming bound for maximum-entropy sampling. Mathematical Programming, Series B, 94:247-256, 2003.

40. Jon Lee. All-different polytopes. Journal of Combinatorial Optimization, 6:335-352, 2002.

41. Jon Lee, Janny Leung, Sven de Vries. Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation. Journal of Combinatorial Optimization, 9:59-67, 2005.

42. Laci Ladanyi, Jon Lee, Robin Lougee-Heimer. Rapid prototyping of optimization algorithms using COIN-OR: A case study involving the cutting-stock problem. Annals of Operations Research, 139:243-265, 2005.

43. Jon Lee, Janny Leung, François Margot. Min-up/min-down polytopes. Discrete Optimization, 1:77-85, 2004.

44. Don Coppersmith, Jon Lee. Parsimonious binary-encoding in integer programming. Discrete Optimization, 2(3):190-200, 2005.

45. Kurt Anstreicher, Jon Lee. A masked spectral bound for maximum-entropy sampling. In: A. Di Bucchianico, H. Läuter, H.P. Wynn, editors, "MODA 7 - Advances in Model-Oriented Design and Analysis", Contributions to Statistics, Springer, Berlin, 1-10, 2004.

46. Jon Lee, François Margot. More on a binary-encoded coloring formulation. In: "Integer Programming and Combinatorial Optimization (New York, 2004)", volume 3064 of Lecture Notes in Computer Science, pages 271-282. Springer, Berlin, 2004.

47. Jon Lee, J.F. Raffensperger, Using AMPL for teaching the TSP, INFORMS Transactions on Education, 7(1):38-70, 2006. Supplemental material. 

48. Jon Lee, François Margot. On a binary-encoded ILP coloring formulation. INFORMS Journal on Computing, 19(3):406-415, 2007.

49. Samuel Burer, Jon Lee. Solving maximum-entropy sampling problems using factored masks. Mathematical Programming, Volume 109, Numbers 2-3, 263-281, March, 2007

50. Jon Lee. In situ column generation for a cutting-stock problem. Computers & Operations Research, Volume 34, Issue 8, August 2007, Pages 2345-2358

51. Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, Francois Margot, Nicolas Sawaya, Andreas Wächter,. An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5:186–204, 2008.

52. Christiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. An MINLP model and solution method for a water-network optimization problem. Algorithms - ESA 2006 (14th Annual European Symposium. Zurich, Switzerland, September 2006, Proceedings), Y. Azar, T. Erlebach, Eds., pages 696-707. Springer, 2006.

53. Oktay Gunluk, Jon Lee, Robert Weismantel. MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL, IBM Research Report RC24213, 03/2007.

54. Jon Lee. Mixed Integer Nonlinear Programming: Some Modeling and Solution Issues, in "Business Optimization", IBM Journal of Research and Development, 51(3/4): 489-497, 2007.

55. Pierre Bonami, John Forrest, Jon Lee, Andreas Wächter. Rapid development of an MINLP solver with COIN-OR, Optima, 75:1-5, December 2007.

56. Jon Lee, Shmuel Onn, Robert Weismantel. On test sets for nonlinear integer maximization. Operations Research Letters 36:439–443, 2008.

57. Walter Dietrich, Jr., J.P. Fasano, Jon Lee. アクセス管理のための承認者選択最適化 (Approver Selection Optimization for Access Management), Special issue on "OR in IBM" of Communications of the Operations Research Society of Japan, 53(3):152-156, 2008.

58. Jesus A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn. Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. Combinatorics, Probability and Computing, volume 18, issue 04, pp. 551-582 (available online).

59. Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry Wynn. Nonlinear Matroid Optimization and Experimental Design, SIAM J. on Discrete Mathematics 22(3):901-919, 2008.

60. Jon Lee, Shmuel Onn, Robert Weismantel, Nonlinear optimization over a weighted independence system. Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management, June 15 - 17, 2009, San Francisco, CA, USA. A. Goldberg, Y. Zhou (Eds.), AAIM 2009, Lecture Notes in Computer Science 5564, Springer, pp. 251–264, 2009.

61. Jesus A. De Loera, Jon Lee, Peter Malkin, Susan Margulies. Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility. Proceedings of the 21st International Symposium on Symbolic and Algebraic Computation (ISSAC 2008, Linz/Hagenberg, Austria), Association for Computing Machinery, 197-206, 2008.

62. Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. Water Network Design by MINLP, Optimization and Engineering 13:219-246, 2012.

63. Anureet Saxena, Pierre Bonami, Jon Lee. Disjunctive cuts for non-convex mixed integer quadratically constrained programs, In: “Integer Programming and Combinatorial Optimization (Bertinoro, 2008)“, A. Lodi, A. Panconesi, G. Rinaldi, Eds., Lecture Notes in Computer Science volume 5035, pp. 17–33. Springer-Verlag Berlin Heidelberg, 2008.

64. Jon Lee. A Celebration of 50 Years of Integer Programming, Optima. 76:10-14, March 2008.

65. Jon Lee, Shmuel Onn, Robert Weismantel. Approximate nonlinear optimization over weighted independence systems. SIAM J. on Discrete Mathematics, Vol. 23, No. 4, 1667-1681, 2009.

66. Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel. Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Mathematical Programming, 2010, Volume 124, Numbers 1-2, Pages 233-253.

67. Pietro Belotti, Jon Lee, Leo Liberti, Francois Margot, Andreas Wächter. Branching and bounds tightening techniques for non-convex MINLP, Optimization Methods and Software, 24(4-5):597 - 634, 2009.

68. Anureet Saxena, Pierre Bonami, Jon Lee. Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Mathematical Programming, Series B, 2010, Volume 124, Numbers 1-2, Pages 383-411.

69. Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Maximizing non-monotone submodular functions under matroid or knapsack constraints. SIAM J. on Discrete Mathematics, Vol. 23, No. 4, pp. 2053–2078, 2010.

70. John Gunnels, Jon Lee, Susan Margulies. Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization, Mathematical Programming Computation, Vol 2, No. 2 (2010), 103-124.

71. Anureet Saxena, Pierre Bonami. Jon Lee. Convex relaxations of non-convex mixed integer quadratically constrained programs: Projected formulations, Mathematical Programming, Series A, 130(2)359-413, 2011.

72. Sonia Cafieri, Jon Lee, Leo Liberti. Comparison of convex relaxations of quadrilinear terms, In: Global Optimization: Theory, Methods and Applications, C. Ma, L. Yu, D. Zhang, Z. Zhou, eds. Proceeding of the First World Congress on Global Optimization in Engineering & Science, WCGO-2009, Lecture Notes in Decision Sciences, Vol. 12, 999-1005.

73. J. De Loera, D.C. Haws, J. Lee, A. O’Hair, Computation in multicriteria matroid optimization. ACM Journal on Experimental Algorithmics, Volume 14, Article No. 8, 2009.

74. Jesus A. De Loera, Jon Lee, Peter Malkin, Susan Margulies. Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz. Journal of Symbolic Computation 46 (2011) 1260–1283.

75. Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Non-monotone submodular maximization under matroid and knapsack constraints, Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), 323-332.

76. Jon Lee, Maxim Sviridenko, Jan Vondrák. Submodular maximization over multiple matroids via generalized exchange properties, Proceedings of APPROX 2009, Dinur, I.; Jansen, K.; Naor, S.; Rolim, J.D.P. (Eds.), Lecture Notes in Computer Science, Volume 5687, pp. 244-257. Journal version: Mathematics of Operations Research, Vol. 35, No. 4 (2010), 795-806.

77. Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti. Feasibility-based bounds tightening via fixed points. COCOA 2010, Lecture Notes in Computer Science, Volume 6508 (2010), 65-76.

78. Sonia Cafieri, Pietro Belotti, Jon Lee, Leo Liberti. On convex relaxations of quadrilinear terms, Journal of Global Optimization, Vol. 47, No. 4 (2010), 661-685.

79. Claudia D'Ambrosio, Jon Lee, Andreas Wächter. A global-optimization algorithm for mixed-integer nonlinear programs having separable non-convexity. Proceedings of ESA 2009, Fiat, Amos; Sanders, Peter (Eds.), Lecture Notes in Computer Science, Volume 5757, pp. 107-118.

80. Jon Lee. On the boundary of tractability for nonlinear discrete optimization. Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, L. Liberti, Eds. Pages 373-383.

81. Claudia D'Ambrosio, Jon Lee, Andreas Wächter. An algorithmic framework for MINLP with separable non-convexity. In: "Mixed Integer Nonlinear Programming", S. Leyffer, J. Lee, Eds., The IMA Volumes in Mathematics and its Applications, Vol. 154. 1st Edition, 2012, pp. 315-347.

82. Raymond Hemmecke, Mathias Köppe, Jon Lee, Robert Weismantel. Nonlinear integer programming. In: M. Jünger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, L. Wolsey (eds.), 50 Years of Integer Programming 1958–2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2010, ISBN 3540682740, pp. 561-618.

83. Jon Lee, Maxim Sviridenko, Jan Vondrák. Matroid Matching: the Power of Local Search, Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 2010), pp. 369-378.

84. Jon Lee, Maxim Sviridenko, Jan Vondrák.  Matroid matching: the power of local search. SIAM J. Comput. 42-1 (2013), pp. 357-379.

85. Jon Lee, Shmuel Onn, Robert Weismantel. Intractability of approximate multi-dimensional nonlinear optimization on independence systems. Discrete Mathematics, Volume 311, Issues 8-9, 6 May 2011, Pages 780-783.

86. Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio, Mucherino, Maxim Sviridenko, Discretization orders for distance geometry problems. Optimization Letters, 6:783–796, 2012.

87. David Melville, Alan E. Rosenbluth, Kehan Tian, Kafai Lai, Saeed Bagheri, Jaione Tirapu-Azpiroz, Jason Meiring, Scott Halle, Greg McIntyre, Tom Faure, Daniel Corliss, Azalia Krasnoperova, Lei Zhuang, Phil Strenski, Andreas Waechter, Laszlo Ladanyi, Francisco Barahona, Daniele Scarpazza, Jon Lee, Tadanobu Inoue, Masaharu Sakamoto, Hidemasa Muta, Alfred Wagner, Geoffrey Burr, Young Kim, Emily Gallagher, Mike Hibbs, Alexander Tritchkov, Yuri Granik, Moutaz Fakhry, Kostas Adamg, Gabriel Bergerg, Michael Lam, Aasutosh Dave, Nick Cobb. Demonstrating the Benefits of Source-Mask Optimization and Enabling Technologies through Experiment and Simulations, Proc. SPIE (The International Society for Optical Engineering), Vol. 7640, 764006-(1-18), 2010.

88. Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel. The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions, Mathematical Programming, Series B, Volume 136, Issue 2, 301-323, 2012.

89. Kafai Lai, Maria Gabrani, David L. DeMaris, Nathalie Casati, J. Andres Torres, Sankha Sarkar, Phil Strenski, Saeed Bagheri, Daniele P. Scarpazza, Alan E. Rosenbluth, David O. Melville, Andreas Waechter, Jon Lee, Vernon Austel, Marc Millstone, Kehan Tian, Francisco Barahona. Design-specific joint optimization of masks and sources on a very large scale.  Proc. SPIE (The International Society for Optical Engineering), Vol. 7973, 797308-(1-13), 2011.

90. Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, Francois Margot, Andreas Waechter. A Probing Algorithm for MINLP with Failure Prediction by SVM, In: CPAIOR 2011, LNCS Volume 6697, T. Achterberg, J.C. Beck (Eds.), pp. 154-169, 2011.

91. Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino. On the number of solutions of the discretizable molecular distance geometry problem. In: COCOA 2011, LNCS Volume 6831, W. Wang, X. Zhu, D.-Z. Du (Eds.), pp. 322–342, 2011.

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

93. Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti, Andrew Miller. On the composition of convex envelopes for quadrilinear terms. In: “Optimization, Simulation and Control,” Springer Optimization and its Application series (Edited by A. Chinchuluun, P.M. Pardalos, R. Enkhbat, E.N. Pistikopoulos), Volume 76, 1-16, 2013. 

94. Pierre Bonami, Jon Lee, Sven Leyffer, Andreas Waechter. On branching rules for convex mixed-integer nonlinear optimization. ACM Journal on Experimental Algorithmics, Vol. 18 (2013), Article 2.6, 31 pp.

95. Jon Lee, Leo Liberti, A matroid view of key theorems for edge-swapping algorithms. Mathematical Methods of Operations Research, Volume 76, Number 2, 125-127, 2012. 

96. Jon Lee. Techniques for Submodular Maximization. Fields Institute Communications Series on Discrete Geometry and Optimization (Edited by Karoly Bezdek, Yinyu Ye, Antoine Deza), Springer, 163-178, 2013.

97. Benyamin Krauss, Jon Lee , Daniel Newman. Optimizing the Assignment of Students to Classes in an Elementary School. INFORMS Transactions on Education, Vol. 14, No. 1, 39-44, 2013.

98. Jesús A. De Loera, Jon Lee, Susan Margulies, Jake Miller, Systems of Polynomials for Detecting Orientable Matroids, Electronic Notes in Discrete Mathematics, Vol. 43, 343–353, 2013.

99. Jesús A. De Loera, Jon Lee, Susan Margulies, Jake Miller, Weak orientability of matroids and polynomial equations. European Journal of Combinatorics, Vol. 50, 56–71, 2015.

100. Marcia Fampa, Jon Lee, Wendel Melo. On global optimization with indefinite quadratics. EURO Journal on Computational Optimization, 5(3):309–337, 2017.

101. Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. Optimizing the design of water distribution networks using mathematical optimization. “Case Studies in Operations Research: Applications of Optimal Decision Making," edited by K. Murty, pp. 183-198, Springer, 2015.

102. Jon Lee, Bai Zou. Optimal rank-sparsity decomposition, Journal of Global Optimization, 60(2):307-315, 2014.

103. Jesús De Loera, Raymond Hemmecke, Jon Lee. On augmentation algorithms for linear and integer-linear programming: from Edmonds-Karp to Bland and beyond. SIAM Journal on Optimization, 25(4):2494–2511, 2015. 

104. Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske. On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space. E. Bampis (Ed.): SEA 2015, Lecture Notes in Computer Science 9125, pp. 122–133, 2015.

105. Andrew Orso, Jon Lee, Siqian Shen. Submodular minimization in the context of modern LP and MILP methods and solvers. E. Bampis (Ed.): SEA 2015, Lecture Notes in Computer Science 9125, pp. 193–204, 2015.

106. Jon Lee, Daphne Skipper. An algebraic-perturbation variant of Barvinok’s algorithm, Electronic Notes in Discrete Mathematics, Vol. 50, Dec. 2015, Pages 15–20. VIII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS, 2015. 

107. Jon Lee, Daphne Skipper. Computing with an algebraic-perturbation variant of Barvinok's algorithm. Discrete Applied Mathematics, 240:63-77, 2018.

108. Marcia Fampa, Jon Lee, Wendel Melo. A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space. Computational Optimization and Applications, 65:47–71, 2016.

109.  Marcia Fampa, Jon Lee, Nelson Maculan. An overview of exact algorithms for the Euclidean Steiner tree problem in n-space. International Transactions in Operational Research, 23(5):861–874, 2016.

110. Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge. Extended formulations for independence polytopes of regular matroids. Graphs and Combinatorics, 32(5):1931-1944, 2016. 

111. Qi He, Jon Lee. Another pedagogy for pure-integer Gomory. RAIRO – Operations Research, 51:189–197, 2017.

112. Emily Speakman, Jon Lee. Quantifying double McCormick. Mathematics of Operations Research 42(4):1230-1253, 2017. 

113. Jon Lee, Angelika Wiegele. Another pedagogy for mixed-integer Gomory. EURO Journal on Computational Optimization, 5:455–466, 2017. 

114. Jon Lee, Viswanath Nagarajan, Xiangkun Shen. Max-cut under graph constraints. IPCO 2016, Lecture Notes in Computer Science, Volume 9682, pp 50-62, 2016.

115. Jon Lee, Daphne Skipper. Virtuous smoothing for global optimization. Journal of Global Optimization, 69:677-697, 2017. 

116. Emily Speakman, Jon Lee. On sBB branching for trilinear monomials. Proceedings of GOW’16, pp. 81–84, 2016. Ana Maria A. C. Rocha, M. Fernanda P. Costa,  Edite M. G. P. Fernandes, eds. ISBN: 978-989-20-6764-3.

117. Victor K. Fuentes, Marcia Fampa, Jon Lee. Sparse pseudoinverses via LP and SDP relaxations of Moore-Penrose. Proceedings of the XVIII Latin-Iberoamerican Conference on Operations Research (CLAIO 2016), Sergio Maturana, ed. ISBN: 978-956-9892-00-4, pp. 342-350, 2016. 

118. Emily Speakman, Han Yu, Jon Lee. Experimental validation of volume-based comparison for double-McCormick relaxations. D. Salvagnin and M. Lombardi (Eds.): CPAIOR 2017, LNCS 10335, pp. 229–243, 2017. 

119. Victor K. Fuentes, Jon Lee. Low-rank/sparse-inverse decomposition via Woodbury.  OR2016 (Hamburg) proceedings (Springer), pp. 111-117, 2017.  doi.org/10.1007/978-3-319-55702-1_16

120. Jon Lee, Viswanath Nagarajan, Xiangkun Shen. Approximating graph-constrained max-cut. Mathematical Programming, Series B, 172(1), 35-58, 2018. 

121. Jon Lee, Leo Liberti. On an SDP relaxation for kissing number. Optimization Letters,14(2):417-422, 2020. 

122. Yan Deng, Huiwen Jia, Shabbir Ahmed, Jon Lee, Siqian Shen. Scenario grouping and decomposition algorithms for chance-constrained programs. To appear in INFORMS Journal on Computing. 

123. Jon Lee, Daphne Skipper. Volume computation for sparse boolean quadric relaxations. Discrete Applied Mathematics.

124. Emily Speakman, Jon Lee. On branching-point selection for triple products in spatial branch-and-bound: the hull relaxation. Journal of Global Optimization. 

125. Luze Xu, Jon Lee, Daphne Skipper. More virtuous smoothing. SIAM Journal on Optimization, 29(2):1240–1259, 2019.

126. Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen. Approximating Max-Cut under graph-MSO constraints. Operations Research Letters, 46:592-598, 2018. 

127. Marcia Fampa, Jon Lee. Convexification of bilinear forms through non-symmetric lifting. Journal of Global Optimization, 80:287-305, 2021.

128. Jon Lee, Daphne Skipper, Emily Speakman. Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations. Mathematical Programming, Series B, 170:121–140, 2018.

129. Claudia D’Ambrosio, Jon Lee, Leo Liberti, Maks Ovsjanikov. Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization. Optimization and Engineering, 20(2):337-347, 2019.

130. Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske. On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. Optimization Letters. 14(2):409-415, 2020.

131. Marcia Fampa, Jon Lee. On sparse reflexive generalized inverses. Operations Research Letters, 46:605-610, 2018. 

132. Jon Lee, Daphne Skipper, Emily Speakman. Gaining or losing perspective. In: WCGO 2019: Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2020, Le Hoai An Thi, Hoai Minh Le, Tao Pham Dinh, eds. pp. 387-397. 

133. Claudia D'Ambrosio, Jon Lee, Daphne Skipper, Dimitri Thomopulos. Handling separable non-convexities using disjunctive cuts. ISCO 2020, 102-114. Lecture Notes in Computer Science, Springer.

134. Victor Fuentes, Marcia Fampa, Jon Lee. Diving for sparse partially-reflexive generalized inverses. In: WCGO 2019: Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2020, Le Hoai An Thi, Hoai Minh Le, Tao Pham Dinh, eds. pp. 89-98.

135. Luze Xu, Jon Lee. On proximity for k-regular mixed-integer linear optimization. In: WCGO 2019: Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2020, Le Hoai An Thi, Hoai Minh Le, Tao Pham Dinh, eds. pp. 438-447. 

136. Luze Xu, Marcia Fampa, Jon Lee, Gabriel Ponte. Approximate 1-norm minimization and minimum-rank structured sparsity for various generalized inverses via local search. SIAM Journal on Optimization, 31(3):1722-1747, 2021. 

137. Luze Xu, Marcia Fampa, Jon Lee. 1-norm minimization and minimum-rank structured sparsity for symmetric and ah-symmetric generalized inverses: rank one and two. To appear in: Fields Institute Communications Series volume on Data Science and Optimization (Deza, Gupta, Pokutta, eds.).

138. Jon Lee, Daphne Skipper, Emily Speakman. Gaining or losing perspective, Journal of Global Optimization, 82:835-862, 2022. 

139. Marcia Fampa, Jon Lee, Gabriel Ponte, Luze Xu. Experimental analysis of local search for sparse reflexive generalized inverses. Journal of Global Optimization, 81:1057-1093, 2021.

140. Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu. Improving proximity bounds using sparsity. ISCO 2020, 115-127. Lecture Notes in Computer Science, Springer.

141. Zhongzhu Chen, Marcia Fampa, Amélie Lambert, Jon Lee. Mixing convex-optimization bounds for maximum-entropy sampling. Mathematical Programming, Series B, 188:539-568, 2021.

142. Hessa Al-Thani, Jon Lee. An R Package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data. SN Operations Research Forum, Volume 1, Article number: 17, 2020.

143. Jon Lee, Daphne Skipper, Emily Speakman, Luze Xu. Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions. In: Graphs and Combinatorial Optimization: from Theory to Applications, CTW 2020, Claudio Gentile, Giuseppe Stecca and Paolo Ventura, editors. AIRO Springer Series, Volume 5, pp 349-360, 2021.

144. Jon Lee, Daphne Skipper, Emily Speakman, Luze Xu. Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions. Journal version. Journal of Optimization Theory and Applications, 196:1-35, 2023.

145. Marcia Fampa, Jon Lee, Gabriel Ponte. Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. Open Journal on Mathematical Optimization, Volume 2 (2021), article no. 4, 14 p.

146. Hessa Al-Thani, Jon Lee. Tridiagonal maximum-entropy sampling and tridiagonal masks. LAGOS 2021; Procedia Computer Science 195:127-134, 2021. https://doi.org/10.1016/j.procs.2021.11.018  

147. M. Diekerhof et al., Electrical Energy Systems: Production and Demand Management. Chapter in: Hadjidimitriou, N.S., Frangioni, A., Koch, T., Lodi, A. (Eds.), Mathematical Optimization for Efficient and Robust Energy Networks, AIRO Springer Series, Volume 4, 2021.  

148. Zhongzhu Chen, Marcia Fampa, Jon Lee. Masking Anstreicher's linx bound for improved entropy bounds. Operations Research; appeared online, 2022. https://doi.org/10.1287/opre.2022.2324 

149. Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu. Polynomial upper bounds on the number of differing columns Δ-modular integer programs. Mathematics of Operations Research, 48(4):2267–2286, 2023. https://doi.org/10.1287/moor.2022.1339 

150. Elisabeth Gaar, Jon Lee, Ivana Ljubić, Markus Sinnl, Kübra Tanınmış. SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. IPCO 2022, Lecture Notes in Computer Science, vol. 13265:262-276. 

151. Hessa Al-Thani, Jon Lee. Tridiagonal maximum-entropy sampling and tridiagonal masks. Discrete Applied Mathematics, 337:120-138, 2023. https://doi.org/10.1016/j.dam.2023.04.020  

152. Zhongzhu Chen, Marcia Fampa, Jon Lee. On computing with some convex relaxations for the maximum-entropy sampling problem. INFORMS Journal on Computing, 35(2):368-385, 2023. https://doi.org//10.1287/ijoc.2022.1264 

153. Luze Xu, Jon Lee. Gaining or losing perspective for convex multivariate functions on a simplex. Journal of Global Optimization, 89:379-314, 2024. https://doi.org/10.1007/s10898-023-01356-y  

154. Marcia Fampa, Jon Lee. An outer-approximation algorithm for maximum-entropy sampling. In: Ljubić, I., Barahona, F., Dey, S.S., Mahjoub, A.R. (eds) Combinatorial Optimization. ISCO 2022. Lecture Notes in Computer Science, vol 13526. https://doi.org/10.1007/978-3-031-18530-4_10 

155. Marcia Fampa, Jon Lee. An outer-approximation algorithm for maximum-entropy sampling. Discrete Applied Mathematics,  347:271-284, 2024. https://doi.org/10.1016/j.dam.2024.01.002 

156. Elisabeth Gaar, Jon Lee, Ivana Ljubić, Markus Sinnl, Kübra Tanınmış. SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. Mathematical Programming, Series B. https://doi.org/10.1007/s10107-023-01965-1 

157. Gabriel Ponte, Marcia Fampa, Jon Lee. Exact and heuristic solution approaches for the D-Optimality problem. SBPO-2022, Proceedings of the LIV Simpósio Brasileiro de Pesquisa Operacional, SOBRAPO, November 2022. https://proceedings.science/sbpo-2022/trabalhos/exact-and-heuristic-solution-approaches-for-the-d-optimality-problem 

158. Yongchun Li, Marcia Fampa, Jon Lee, Feng Qiu, Weijun Xie, Rui Yao. D-optimal data fusion: exact and approximation algorithms. INFORMS Journal on Computing, 36(1):97-120, 2023.  https://doi.org/10.1287/ijoc.2022.0235 

159. Steffen Borgwardt, Weston Grewe, Jon Lee. On the combinatorial diameters of parallel and series connections. SIAM Journal on Discrete Mathematics, 38(1):485-503, 2024. https://doi.org/10.1137/22M1490508   

160. Zhongzhu Chen, Marcia Fampa, Jon Lee. Generalized scaling for the constrained maximum-entropy sampling problem. To appear in Mathematical Programming. https://arxiv.org/abs/2306.14661  (Extension of ACDA 2023 paper).

161. Gabriel Ponte, Marcia Fampa, Jon Lee. Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening https://arxiv.org/abs/2309.00117 (Extension of SBPO 2022 paper).

162. Luze Xu, Jon Lee. Gaining or losing perspective for convex multivariate functions on box domains. Mathematical Programming, Series B. https://doi.org/10.1007/s10107-024-02087-y 

163. Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu. On computing sparse generalized inverses. Operations Research Letters, 52:107058, 2024.  https://doi.org/10.1016/j.orl.2023.107058  

164. Gabriel Ponte, Marcia Fampa, Jon Lee. Convex relaxation for the generalized maximum-entropy sampling problem. Proceedings of the 22nd International Symposium on Experimental Algorithms (SEA 2024), Leibniz International Proceedings in Informatics (LIPIcs), vol. 301, Leo Liberti, ed., Article No. 25 (14 pages) https://doi.org/10.4230/LIPIcs.SEA.2024.25 .

165. Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu. Good and fast row-sparse ah-symmetric reflexive generalized inverses. https://arxiv.org/abs/2401.17540  

166. Steffen Borgwardt, Weston Grewe, Sean Kafer, Jon Lee, Laura Sanità. On the hardness of short and sign-compatible circuit walks. https://arxiv.org/abs/2402.01066  

167. Steffen Borgwardt, Weston Grewe, Jon Lee. On the diameter of a 2-sum of polyhedra.  https://arxiv.org/abs/2311.02047 

168. Gabriel Ponte, Marcia Fampa, Jon Lee. Convex relaxation for the generalized maximum-entropy sampling problem. https://arxiv.org/abs/2404.01390  (Extension of SEA 2024 paper).

You can get Math Reviews and BibTeX citations for many of my papers from the MathSciNet of the AMS.

ORCID: 0000-0002-8190-1091

My Google Scholar page is another source.

Books 

1. Jon Lee, "A First Course in Combinatorial Optimization", Cambridge University Press, February 2004. eBook, ISBN: 9780511189678. Hardback, ISBN: 0521811511. Paperback, ISBN: 0521010128. -> shop.

2. Jon Lee, "A First Course in Linear Optimization", Fourth Edition, Version 4.08 (https://github.com/jon77lee/JLee_LinearOptimizationBook/blob/master/JLee.4.08.7z), Reex Press, 2013-24) and associated software (https://github.com/jon77lee/JLee_LinearOptimizationBook/blob/master/JLee.4.08.software.zip) [Jupyter Notebooks using Python and Gurobi].

3. Marcia Fampa, Jon Lee. “Maximum-Entropy Sampling: Algorithms and Application”. Springer Series in Operations Research and Financial Engineering. October 2022. https://link.springer.com/book/9783031130779 -> shop.

Edited volumes

1. Serkan Hosten, Jon Lee, Rekha Thomas, Editors. "Trends in Optimization". Proceedings of Symposia in Applied Mathematics, Volume 61. American Mathematical Society, 2004, 140 pp., Hardback: ISBN 0-8218-3584-X.

2. Jon Lee, Adam Letchford, Guest Editors. "Mixed Integer Programming, IMA Special Workshop on Mixed-Integer Programming", Special volume of: Discrete Optimization (Volume 4, Issue 1, Pages 1-142, 2007). 

3. Jon Lee, Sven Leyffer, Editors. "Mixed Integer Nonlinear Programming". The IMA Volumes in Mathematics and its Applications, Vol. 154. 1st Edition., 2012, X, 660 p. 1 illus. Hardback, ISBN 978-1-4614-1926-6.

4. Jon Lee, Jens Vygen, Editors. "Integer Programming and Combinatorial Optimization". 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014, Proceedings. Springer, Lecture Notes in Computer Science, Vol. 8494. ISBN 978-3-319-07556-3.

5. Jon Lee, Jens Vygen, Editors. Mathematical Programming, Series B. Issue 1-2, December 2015. "Special Issue: Integer Programming and Combinatorial Optimization, 2014." ISSN: 0025-5610 (Print) 1436-4646 (Online). 

6. Jon Lee, Ridha Mahjoub, Giovanni Rinaldi, Eds. Combinatorial Optimization. 5th International Symposium on Combinatorial Optimization, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Proceedings. Springer, Lecture Notes in Computer Science, volume 10856, 2018. ISBN 978-3-319-96150-7.

7. Jon Lee, Ridha Mahjoub, Giovanni Rinaldi, Eds. “Combinatorial Optimization”. Special issue of Discrete Applied Mathematics, Volume 308, 2022. doi: 10.1016/j.dam.2021.12.012 

1. Jon Lee. Turán's triangle theorem and binary matroids. European Journal of Combinatorics, 10(1):85-90, 1989.

2. Jon Lee. Subspaces with well-scaled frames. Linear Algebra and its Applications, 114/115: 21-56, 1989.

3. Jon Lee. The incidence structure of subspaces with well-scaled frames. Journal of Combinatorial Theory, Series B, 50(2):265-287, 1990.

4. Jon Lee. A spectral approach to polyhedral dimension. Mathematical Programming, Series A, 47(3):441-459, 1990.

5. Jon Lee. Canonical equation sets for classes of concordant polytopes. Discrete Applied Mathematics, 28(3):207-221, 1990.

6. Jon Lee. Characterizations of the dimension for classes of concordant polytopes. Mathematics of Operations Research, 15(1):139-154, 1990.

7. Jon Lee, Yew Sing Lee. A spectral method for concordant polyhedral faces. Linear Algebra and its Applications, 159:11-41, 1991.

8. Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford. Crashing a maximum-weight complementary basis. Mathematical Programming, Series A, 54(3):281-294, 1992.

9. Imre Bárány, Jon Lee, Martin Shubik. Classification of two-person ordinal bimatrix games. International Journal of Game Theory, 21(3):267-290, 1992.

10. Jon Lee. On constrained bottleneck extrema. Operations Research, 40:813-814, 1992.

11. Jon Lee, Jennifer Ryan. Matroid applications and algorithms. ORSA (now INFORMS) Journal on Computing, 4(1):70-98, 1992.

12. Brenda L. Dietrich, Jon Lee, Yew Sing Lee. Order selection on a single machine with high set-up costs. Annals of Operations Research, 43(1-4):379-396, 1993.

13. Jon Lee, Janny Leung. A comparison of two edge-coloring formulations. Operations Research Letters, 13(4):215-223, 1993.

14. Jon Lee, Walter D. Morris, Jr. Geometric comparison of combinatorial polytopes. Discrete Applied Mathematics, 55(2):163-182, 1994.

15. Jon Lee, Jennifer Ryan. Local bipartite Turan graphs and graph partitioning. Networks, 24(3):131-145, 1994.

16. Janny Leung, Jon Lee. More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Applied Mathematics, 50(2):185-200, 1994.

17. Chun-Wa Ko, Jon Lee, Maurice Queyranne. An exact algorithm for maximum entropy sampling. Operations Research, 43(4):684-691, 1995.

18. T.L. Hayden, Jon Lee, Jim Wells, P. Tarazaga. Block matrices and multispherical structure of distance matrices. Linear Algebra and its Applications, 247:203-216, 1996.

19. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. Continuous relaxations for constrained maximum-entropy sampling. In: "Integer Programming and Combinatorial Optimization (Vancouver, BC, 1996)", volume 1084 of Lecture Notes in Computer Science, pages 234-248. Springer, Berlin, 1996.

20. Chun-Wa Ko, Jon Lee, Einar Steingrímsson. The volume of relaxed Boolean-quadric and cut polytopes. Discrete Mathematics, 163(1-3):293-298, 1997.

21. Jon Lee. Hoffman's circle untangled. SIAM Review, 39(1):98-105, 1997.

22. Jill Hardin, Jon Lee, Janny Leung. On the Boolean-quadric packing uncapacitated facility-location polytope. Annals of Operations Research, 83:73-94, 1998.

23. Jon Lee. Discussion on: `A state-space-model approach to optimal spatial sampling design based on entropy'. Environmental and Ecological Statistics, 5:45-46, 1998.

24. Chun-Wa Ko, Jon Lee, Kevin Wayne. Comparison of spectral and Hadamard bounds for D-optimality. In: A.C. Atkinson, L. Pronzato, H.P. Wynn, editors, "MODA 5 - Advances in Model-Oriented Data Analysis and Experimental Design", Contributions to Statistics. Springer, Berlin, 21-29, 1998.

25. Jon Lee. Constrained maximum-entropy sampling. Operations Research, 46:655-664, 1998.

26. Jon Lee. Semidefinite programming in experimental design. In: H. Wolkowicz, R. Saigal, L. Vandenberghe, editors, "Handbook of Semidefinite Programming", International Series in Operations Research and Management Science, Vol. 27, Kluwer, 2000.

27. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Mathematical Programming, Series A, 85:221-240, 1999.

28. Jon Lee, Matt Scobee. A characterization of the orientations of ternary matroids. Journal of Combinatorial Theory, Series B, 77:263-291, 1999.

29. Jon Lee. Orienting matroids representable over both GF(3) and GF(5). European Journal of Combinatorics, 20:833-838, 1999.

30. Jon Lee, Dan Wilson. Polyhedral methods for piecewise-linear functions I: The lambda method. Discrete Applied Mathematics, 108:269-285, 2001.

31. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. Maximum-entropy remote sampling. Discrete Applied Mathematics, 108:211-226, 2001.

32. Jon Lee. Maximum entropy sampling. In A.H. El-Shaarawi, W.W. Piegorsch, editors, “Encyclopedia of Environmetrics”, Volume 3, pp 1229-1234. John Wiley & Sons Ltd, Chichester, UK, 2001. Article updated in “Encyclopedia of Environmetrics,  Second Edition”, pp.1570-1574, 2012.

33. Alan Hoffman, Jon Lee, Joy Williams. New upper bounds for maximum-entropy sampling. In: A.C. Atkinson, P. Hackl, W. G. Müller, editors, "MODA 6 - Advances in Model-Oriented Design and Analysis", Contributions to Statistics, Springer, Berlin, 143-153, 2001.

34. Jon Lee, Joy Williams. Generalized maximum-entropy sampling. INFOR: Information Systems and Operational Research, 58(2):168-181, 2020. 

35. Don Coppersmith, Jon Lee, Janny Leung. A polyhedron for products of linear functions in 0/1 variables. IBM Research Report RC21568, September 1999. Revised with Oktay Gunluk in: "Mixed Integer Nonlinear Programming", S. Leyffer and J. Lee, Eds., The IMA Volumes in Mathematics and its Applications, Vol. 154. 1st Edition, 2012, pp. 513-529.

36. Don Coppersmith, Jon Lee. Indivisibility and divisibility polytopes. In: "Novel Approaches to Hard Discrete Optimization" (P.M. Pardalos, H. Wolkowicz, Editors), Fields Institute Communications Series, Volume 37, American Mathematical Society, 2003, pp. 71-95.

37. Jon Lee, Janny Leung. On the Boolean quadric forest polytope. INFOR Journal, 42(2):125-141, 2004.

38. Jon Lee. Cropped cubes. Journal of Combinatorial Optimization, 7:169-178, 2003.

39. Jon Lee, Joy Williams. A linear integer programming bound for maximum-entropy sampling. Mathematical Programming, Series B, 94:247-256, 2003.

40. Jon Lee. All-different polytopes. Journal of Combinatorial Optimization, 6:335-352, 2002.

41. Jon Lee, Janny Leung, Sven de Vries. Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation. Journal of Combinatorial Optimization, 9:59-67, 2005.

42. Laci Ladanyi, Jon Lee, Robin Lougee-Heimer. Rapid prototyping of optimization algorithms using COIN-OR: A case study involving the cutting-stock problem. Annals of Operations Research, 139:243-265, 2005.

43. Jon Lee, Janny Leung, François Margot. Min-up/min-down polytopes. Discrete Optimization, 1:77-85, 2004.

44. Don Coppersmith, Jon Lee. Parsimonious binary-encoding in integer programming. Discrete Optimization, 2(3):190-200, 2005.

45. Kurt Anstreicher, Jon Lee. A masked spectral bound for maximum-entropy sampling. In: A. Di Bucchianico, H. Läuter, H.P. Wynn, editors, "MODA 7 - Advances in Model-Oriented Design and Analysis", Contributions to Statistics, Springer, Berlin, 1-10, 2004.

46. Jon Lee, François Margot. More on a binary-encoded coloring formulation. In: "Integer Programming and Combinatorial Optimization (New York, 2004)", volume 3064 of Lecture Notes in Computer Science, pages 271-282. Springer, Berlin, 2004.

47. Jon Lee, J.F. Raffensperger, Using AMPL for teaching the TSP, INFORMS Transactions on Education, 7(1):38-70, 2006. Supplemental material. 

48. Jon Lee, François Margot. On a binary-encoded ILP coloring formulation. INFORMS Journal on Computing, 19(3):406-415, 2007.

49. Samuel Burer, Jon Lee. Solving maximum-entropy sampling problems using factored masks. Mathematical Programming, Volume 109, Numbers 2-3, 263-281, March, 2007

50. Jon Lee. In situ column generation for a cutting-stock problem. Computers & Operations Research, Volume 34, Issue 8, August 2007, Pages 2345-2358

51. Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, Francois Margot, Nicolas Sawaya, Andreas Wächter,. An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5:186–204, 2008.

52. Christiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. An MINLP model and solution method for a water-network optimization problem. Algorithms - ESA 2006 (14th Annual European Symposium. Zurich, Switzerland, September 2006, Proceedings), Y. Azar, T. Erlebach, Eds., pages 696-707. Springer, 2006.

53. Oktay Gunluk, Jon Lee, Robert Weismantel. MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL, IBM Research Report RC24213, 03/2007.

54. Jon Lee. Mixed Integer Nonlinear Programming: Some Modeling and Solution Issues, in "Business Optimization", IBM Journal of Research and Development, 51(3/4): 489-497, 2007.

55. Pierre Bonami, John Forrest, Jon Lee, Andreas Wächter. Rapid development of an MINLP solver with COIN-OR, Optima, 75:1-5, December 2007.

56. Jon Lee, Shmuel Onn, Robert Weismantel. On test sets for nonlinear integer maximization. Operations Research Letters 36:439–443, 2008.

57. Walter Dietrich, Jr., J.P. Fasano, Jon Lee. アクセス管理のための承認者選択最適化 (Approver Selection Optimization for Access Management), Special issue on "OR in IBM" of Communications of the Operations Research Society of Japan, 53(3):152-156, 2008.

58. Jesus A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn. Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. Combinatorics, Probability and Computing, volume 18, issue 04, pp. 551-582 (available online).

59. Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry Wynn. Nonlinear Matroid Optimization and Experimental Design, SIAM J. on Discrete Mathematics 22(3):901-919, 2008.

60. Jon Lee, Shmuel Onn, Robert Weismantel, Nonlinear optimization over a weighted independence system. Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management, June 15 - 17, 2009, San Francisco, CA, USA. A. Goldberg, Y. Zhou (Eds.), AAIM 2009, Lecture Notes in Computer Science 5564, Springer, pp. 251–264, 2009.

61. Jesus A. De Loera, Jon Lee, Peter Malkin, Susan Margulies. Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility. Proceedings of the 21st International Symposium on Symbolic and Algebraic Computation (ISSAC 2008, Linz/Hagenberg, Austria), Association for Computing Machinery, 197-206, 2008.

62. Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. Water Network Design by MINLP, Optimization and Engineering 13:219-246, 2012.

63. Anureet Saxena, Pierre Bonami, Jon Lee. Disjunctive cuts for non-convex mixed integer quadratically constrained programs, In: “Integer Programming and Combinatorial Optimization (Bertinoro, 2008)“, A. Lodi, A. Panconesi, G. Rinaldi, Eds., Lecture Notes in Computer Science volume 5035, pp. 17–33. Springer-Verlag Berlin Heidelberg, 2008.

64. Jon Lee. A Celebration of 50 Years of Integer Programming, Optima. 76:10-14, March 2008.

65. Jon Lee, Shmuel Onn, Robert Weismantel. Approximate nonlinear optimization over weighted independence systems. SIAM J. on Discrete Mathematics, Vol. 23, No. 4, 1667-1681, 2009.

66. Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel. Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Mathematical Programming, 2010, Volume 124, Numbers 1-2, Pages 233-253.

67. Pietro Belotti, Jon Lee, Leo Liberti, Francois Margot, Andreas Wächter. Branching and bounds tightening techniques for non-convex MINLP, Optimization Methods and Software, 24(4-5):597 - 634, 2009.

68. Anureet Saxena, Pierre Bonami, Jon Lee. Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Mathematical Programming, Series B, 2010, Volume 124, Numbers 1-2, Pages 383-411.

69. Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Maximizing non-monotone submodular functions under matroid or knapsack constraints. SIAM J. on Discrete Mathematics, Vol. 23, No. 4, pp. 2053–2078, 2010.

70. John Gunnels, Jon Lee, Susan Margulies. Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization, Mathematical Programming Computation, Vol 2, No. 2 (2010), 103-124.

71. Anureet Saxena, Pierre Bonami. Jon Lee. Convex relaxations of non-convex mixed integer quadratically constrained programs: Projected formulations, Mathematical Programming, Series A, 130(2)359-413, 2011.

72. Sonia Cafieri, Jon Lee, Leo Liberti. Comparison of convex relaxations of quadrilinear terms, In: Global Optimization: Theory, Methods and Applications, C. Ma, L. Yu, D. Zhang, Z. Zhou, eds. Proceeding of the First World Congress on Global Optimization in Engineering & Science, WCGO-2009, Lecture Notes in Decision Sciences, Vol. 12, 999-1005.

73. J. De Loera, D.C. Haws, J. Lee, A. O’Hair, Computation in multicriteria matroid optimization. ACM Journal on Experimental Algorithmics, Volume 14, Article No. 8, 2009.

74. Jesus A. De Loera, Jon Lee, Peter Malkin, Susan Margulies. Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz. Journal of Symbolic Computation 46 (2011) 1260–1283.

75. Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Non-monotone submodular maximization under matroid and knapsack constraints, Proceedings of the 41st ACM Symposium on Theory of Computing (STOC 2009), 323-332.

76. Jon Lee, Maxim Sviridenko, Jan Vondrák. Submodular maximization over multiple matroids via generalized exchange properties, Proceedings of APPROX 2009, Dinur, I.; Jansen, K.; Naor, S.; Rolim, J.D.P. (Eds.), Lecture Notes in Computer Science, Volume 5687, pp. 244-257. Journal version: Mathematics of Operations Research, Vol. 35, No. 4 (2010), 795-806.

77. Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti. Feasibility-based bounds tightening via fixed points. COCOA 2010, Lecture Notes in Computer Science, Volume 6508 (2010), 65-76.

78. Sonia Cafieri, Pietro Belotti, Jon Lee, Leo Liberti. On convex relaxations of quadrilinear terms, Journal of Global Optimization, Vol. 47, No. 4 (2010), 661-685.

79. Claudia D'Ambrosio, Jon Lee, Andreas Wächter. A global-optimization algorithm for mixed-integer nonlinear programs having separable non-convexity. Proceedings of ESA 2009, Fiat, Amos; Sanders, Peter (Eds.), Lecture Notes in Computer Science, Volume 5757, pp. 107-118.

80. Jon Lee. On the boundary of tractability for nonlinear discrete optimization. Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, L. Liberti, Eds. Pages 373-383.

81. Claudia D'Ambrosio, Jon Lee, Andreas Wächter. An algorithmic framework for MINLP with separable non-convexity. In: "Mixed Integer Nonlinear Programming", S. Leyffer, J. Lee, Eds., The IMA Volumes in Mathematics and its Applications, Vol. 154. 1st Edition, 2012, pp. 315-347.

82. Raymond Hemmecke, Mathias Köppe, Jon Lee, Robert Weismantel. Nonlinear integer programming. In: M. Jünger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, L. Wolsey (eds.), 50 Years of Integer Programming 1958–2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2010, ISBN 3540682740, pp. 561-618.

83. Jon Lee, Maxim Sviridenko, Jan Vondrák. Matroid Matching: the Power of Local Search, Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC 2010), pp. 369-378.

84. Jon Lee, Maxim Sviridenko, Jan Vondrák.  Matroid matching: the power of local search. SIAM J. Comput. 42-1 (2013), pp. 357-379.

85. Jon Lee, Shmuel Onn, Robert Weismantel. Intractability of approximate multi-dimensional nonlinear optimization on independence systems. Discrete Mathematics, Volume 311, Issues 8-9, 6 May 2011, Pages 780-783.

86. Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio, Mucherino, Maxim Sviridenko, Discretization orders for distance geometry problems. Optimization Letters, 6:783–796, 2012.

87. David Melville, Alan E. Rosenbluth, Kehan Tian, Kafai Lai, Saeed Bagheri, Jaione Tirapu-Azpiroz, Jason Meiring, Scott Halle, Greg McIntyre, Tom Faure, Daniel Corliss, Azalia Krasnoperova, Lei Zhuang, Phil Strenski, Andreas Waechter, Laszlo Ladanyi, Francisco Barahona, Daniele Scarpazza, Jon Lee, Tadanobu Inoue, Masaharu Sakamoto, Hidemasa Muta, Alfred Wagner, Geoffrey Burr, Young Kim, Emily Gallagher, Mike Hibbs, Alexander Tritchkov, Yuri Granik, Moutaz Fakhry, Kostas Adamg, Gabriel Bergerg, Michael Lam, Aasutosh Dave, Nick Cobb. Demonstrating the Benefits of Source-Mask Optimization and Enabling Technologies through Experiment and Simulations, Proc. SPIE (The International Society for Optical Engineering), Vol. 7640, 764006-(1-18), 2010.

88. Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel. The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions, Mathematical Programming, Series B, Volume 136, Issue 2, 301-323, 2012.

89. Kafai Lai, Maria Gabrani, David L. DeMaris, Nathalie Casati, J. Andres Torres, Sankha Sarkar, Phil Strenski, Saeed Bagheri, Daniele P. Scarpazza, Alan E. Rosenbluth, David O. Melville, Andreas Waechter, Jon Lee, Vernon Austel, Marc Millstone, Kehan Tian, Francisco Barahona. Design-specific joint optimization of masks and sources on a very large scale.  Proc. SPIE (The International Society for Optical Engineering), Vol. 7973, 797308-(1-13), 2011.

90. Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, Francois Margot, Andreas Waechter. A Probing Algorithm for MINLP with Failure Prediction by SVM, In: CPAIOR 2011, LNCS Volume 6697, T. Achterberg, J.C. Beck (Eds.), pp. 154-169, 2011.

91. Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino. On the number of solutions of the discretizable molecular distance geometry problem. In: COCOA 2011, LNCS Volume 6831, W. Wang, X. Zhu, D.-Z. Du (Eds.), pp. 322–342, 2011.

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

93. Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti, Andrew Miller. On the composition of convex envelopes for quadrilinear terms. In: “Optimization, Simulation and Control,” Springer Optimization and its Application series (Edited by A. Chinchuluun, P.M. Pardalos, R. Enkhbat, E.N. Pistikopoulos), Volume 76, 1-16, 2013. 

94. Pierre Bonami, Jon Lee, Sven Leyffer, Andreas Waechter. On branching rules for convex mixed-integer nonlinear optimization. ACM Journal on Experimental Algorithmics, Vol. 18 (2013), Article 2.6, 31 pp.

95. Jon Lee, Leo Liberti, A matroid view of key theorems for edge-swapping algorithms. Mathematical Methods of Operations Research, Volume 76, Number 2, 125-127, 2012. 

96. Jon Lee. Techniques for Submodular Maximization. Fields Institute Communications Series on Discrete Geometry and Optimization (Edited by Karoly Bezdek, Yinyu Ye, Antoine Deza), Springer, 163-178, 2013.

97. Benyamin Krauss, Jon Lee , Daniel Newman. Optimizing the Assignment of Students to Classes in an Elementary School. INFORMS Transactions on Education, Vol. 14, No. 1, 39-44, 2013.

98. Jesús A. De Loera, Jon Lee, Susan Margulies, Jake Miller, Systems of Polynomials for Detecting Orientable Matroids, Electronic Notes in Discrete Mathematics, Vol. 43, 343–353, 2013.

99. Jesús A. De Loera, Jon Lee, Susan Margulies, Jake Miller, Weak orientability of matroids and polynomial equations. European Journal of Combinatorics, Vol. 50, 56–71, 2015.

100. Marcia Fampa, Jon Lee, Wendel Melo. On global optimization with indefinite quadratics. EURO Journal on Computational Optimization, 5(3):309–337, 2017.

101. Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. Optimizing the design of water distribution networks using mathematical optimization. “Case Studies in Operations Research: Applications of Optimal Decision Making," edited by K. Murty, pp. 183-198, Springer, 2015.

102. Jon Lee, Bai Zou. Optimal rank-sparsity decomposition, Journal of Global Optimization, 60(2):307-315, 2014.

103. Jesús De Loera, Raymond Hemmecke, Jon Lee. On augmentation algorithms for linear and integer-linear programming: from Edmonds-Karp to Bland and beyond. SIAM Journal on Optimization, 25(4):2494–2511, 2015. 

104. Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske. On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space. E. Bampis (Ed.): SEA 2015, Lecture Notes in Computer Science 9125, pp. 122–133, 2015.

105. Andrew Orso, Jon Lee, Siqian Shen. Submodular minimization in the context of modern LP and MILP methods and solvers. E. Bampis (Ed.): SEA 2015, Lecture Notes in Computer Science 9125, pp. 193–204, 2015.

106. Jon Lee, Daphne Skipper. An algebraic-perturbation variant of Barvinok’s algorithm, Electronic Notes in Discrete Mathematics, Vol. 50, Dec. 2015, Pages 15–20. VIII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS, 2015. 

107. Jon Lee, Daphne Skipper. Computing with an algebraic-perturbation variant of Barvinok's algorithm. Discrete Applied Mathematics, 240:63-77, 2018.

108. Marcia Fampa, Jon Lee, Wendel Melo. A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space. Computational Optimization and Applications, 65:47–71, 2016.

109.  Marcia Fampa, Jon Lee, Nelson Maculan. An overview of exact algorithms for the Euclidean Steiner tree problem in n-space. International Transactions in Operational Research, 23(5):861–874, 2016.

110. Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge. Extended formulations for independence polytopes of regular matroids. Graphs and Combinatorics, 32(5):1931-1944, 2016. 

111. Qi He, Jon Lee. Another pedagogy for pure-integer Gomory. RAIRO – Operations Research, 51:189–197, 2017.

112. Emily Speakman, Jon Lee. Quantifying double McCormick. Mathematics of Operations Research 42(4):1230-1253, 2017. 

113. Jon Lee, Angelika Wiegele. Another pedagogy for mixed-integer Gomory. EURO Journal on Computational Optimization, 5:455–466, 2017. 

114. Jon Lee, Viswanath Nagarajan, Xiangkun Shen. Max-cut under graph constraints. IPCO 2016, Lecture Notes in Computer Science, Volume 9682, pp 50-62, 2016.

115. Jon Lee, Daphne Skipper. Virtuous smoothing for global optimization. Journal of Global Optimization, 69:677-697, 2017. 

116. Emily Speakman, Jon Lee. On sBB branching for trilinear monomials. Proceedings of GOW’16, pp. 81–84, 2016. Ana Maria A. C. Rocha, M. Fernanda P. Costa,  Edite M. G. P. Fernandes, eds. ISBN: 978-989-20-6764-3.

117. Victor K. Fuentes, Marcia Fampa, Jon Lee. Sparse pseudoinverses via LP and SDP relaxations of Moore-Penrose. Proceedings of the XVIII Latin-Iberoamerican Conference on Operations Research (CLAIO 2016), Sergio Maturana, ed. ISBN: 978-956-9892-00-4, pp. 342-350, 2016. 

118. Emily Speakman, Han Yu, Jon Lee. Experimental validation of volume-based comparison for double-McCormick relaxations. D. Salvagnin and M. Lombardi (Eds.): CPAIOR 2017, LNCS 10335, pp. 229–243, 2017. 

119. Victor K. Fuentes, Jon Lee. Low-rank/sparse-inverse decomposition via Woodbury.  OR2016 (Hamburg) proceedings (Springer), pp. 111-117, 2017.  doi.org/10.1007/978-3-319-55702-1_16

120. Jon Lee, Viswanath Nagarajan, Xiangkun Shen. Approximating graph-constrained max-cut. Mathematical Programming, Series B, 172(1), 35-58, 2018. 

121. Jon Lee, Leo Liberti. On an SDP relaxation for kissing number. Optimization Letters,14(2):417-422, 2020. 

122. Yan Deng, Huiwen Jia, Shabbir Ahmed, Jon Lee, Siqian Shen. Scenario grouping and decomposition algorithms for chance-constrained programs. To appear in INFORMS Journal on Computing. 

123. Jon Lee, Daphne Skipper. Volume computation for sparse boolean quadric relaxations. Discrete Applied Mathematics.

124. Emily Speakman, Jon Lee. On branching-point selection for triple products in spatial branch-and-bound: the hull relaxation. Journal of Global Optimization. 

125. Luze Xu, Jon Lee, Daphne Skipper. More virtuous smoothing. SIAM Journal on Optimization, 29(2):1240–1259, 2019.

126. Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen. Approximating Max-Cut under graph-MSO constraints. Operations Research Letters, 46:592-598, 2018. 

127. Marcia Fampa, Jon Lee. Convexification of bilinear forms through non-symmetric lifting. Journal of Global Optimization, 80:287-305, 2021.

128. Jon Lee, Daphne Skipper, Emily Speakman. Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations. Mathematical Programming, Series B, 170:121–140, 2018.

129. Claudia D’Ambrosio, Jon Lee, Leo Liberti, Maks Ovsjanikov. Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization. Optimization and Engineering, 20(2):337-347, 2019.

130. Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske. On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. Optimization Letters. 14(2):409-415, 2020.

131. Marcia Fampa, Jon Lee. On sparse reflexive generalized inverses. Operations Research Letters, 46:605-610, 2018. 

132. Jon Lee, Daphne Skipper, Emily Speakman. Gaining or losing perspective. In: WCGO 2019: Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2020, Le Hoai An Thi, Hoai Minh Le, Tao Pham Dinh, eds. pp. 387-397. 

133. Claudia D'Ambrosio, Jon Lee, Daphne Skipper, Dimitri Thomopulos. Handling separable non-convexities using disjunctive cuts. ISCO 2020, 102-114. Lecture Notes in Computer Science, Springer.

134. Victor Fuentes, Marcia Fampa, Jon Lee. Diving for sparse partially-reflexive generalized inverses. In: WCGO 2019: Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2020, Le Hoai An Thi, Hoai Minh Le, Tao Pham Dinh, eds. pp. 89-98.

135. Luze Xu, Jon Lee. On proximity for k-regular mixed-integer linear optimization. In: WCGO 2019: Optimization of Complex Systems: Theory, Models, Algorithms and Applications, 2020, Le Hoai An Thi, Hoai Minh Le, Tao Pham Dinh, eds. pp. 438-447. 

136. Luze Xu, Marcia Fampa, Jon Lee, Gabriel Ponte. Approximate 1-norm minimization and minimum-rank structured sparsity for various generalized inverses via local search. SIAM Journal on Optimization, 31(3):1722-1747, 2021. 

137. Luze Xu, Marcia Fampa, Jon Lee. 1-norm minimization and minimum-rank structured sparsity for symmetric and ah-symmetric generalized inverses: rank one and two. To appear in: Fields Institute Communications Series volume on Data Science and Optimization (Deza, Gupta, Pokutta, eds.).

138. Jon Lee, Daphne Skipper, Emily Speakman. Gaining or losing perspective, Journal of Global Optimization, 82:835-862, 2022. 

139. Marcia Fampa, Jon Lee, Gabriel Ponte, Luze Xu. Experimental analysis of local search for sparse reflexive generalized inverses. Journal of Global Optimization, 81:1057-1093, 2021.

140. Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu. Improving proximity bounds using sparsity. ISCO 2020, 115-127. Lecture Notes in Computer Science, Springer.

141. Zhongzhu Chen, Marcia Fampa, Amélie Lambert, Jon Lee. Mixing convex-optimization bounds for maximum-entropy sampling. Mathematical Programming, Series B, 188:539-568, 2021.

142. Hessa Al-Thani, Jon Lee. An R Package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data. SN Operations Research Forum, Volume 1, Article number: 17, 2020.

143. Jon Lee, Daphne Skipper, Emily Speakman, Luze Xu. Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions. In: Graphs and Combinatorial Optimization: from Theory to Applications, CTW 2020, Claudio Gentile, Giuseppe Stecca and Paolo Ventura, editors. AIRO Springer Series, Volume 5, pp 349-360, 2021.

144. Jon Lee, Daphne Skipper, Emily Speakman, Luze Xu. Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions. Journal version. Journal of Optimization Theory and Applications, 196:1-35, 2023.

145. Marcia Fampa, Jon Lee, Gabriel Ponte. Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. Open Journal on Mathematical Optimization, Volume 2 (2021), article no. 4, 14 p.

146. Hessa Al-Thani, Jon Lee. Tridiagonal maximum-entropy sampling and tridiagonal masks. LAGOS 2021; Procedia Computer Science 195:127-134, 2021. https://doi.org/10.1016/j.procs.2021.11.018  

147. M. Diekerhof et al., Electrical Energy Systems: Production and Demand Management. Chapter in: Hadjidimitriou, N.S., Frangioni, A., Koch, T., Lodi, A. (Eds.), Mathematical Optimization for Efficient and Robust Energy Networks, AIRO Springer Series, Volume 4, 2021.  

148. Zhongzhu Chen, Marcia Fampa, Jon Lee. Masking Anstreicher's linx bound for improved entropy bounds. Operations Research; appeared online, 2022. https://doi.org/10.1287/opre.2022.2324 

149. Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu. Polynomial upper bounds on the number of differing columns Δ-modular integer programs. Mathematics of Operations Research, 48(4):2267–2286, 2023. https://doi.org/10.1287/moor.2022.1339 

150. Elisabeth Gaar, Jon Lee, Ivana Ljubić, Markus Sinnl, Kübra Tanınmış. SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. IPCO 2022, Lecture Notes in Computer Science, vol. 13265:262-276. 

151. Hessa Al-Thani, Jon Lee. Tridiagonal maximum-entropy sampling and tridiagonal masks. Discrete Applied Mathematics, 337:120-138, 2023. https://doi.org/10.1016/j.dam.2023.04.020  

152. Zhongzhu Chen, Marcia Fampa, Jon Lee. On computing with some convex relaxations for the maximum-entropy sampling problem. INFORMS Journal on Computing, 35(2):368-385, 2023. https://doi.org//10.1287/ijoc.2022.1264 

153. Luze Xu, Jon Lee. Gaining or losing perspective for convex multivariate functions on a simplex. Journal of Global Optimization, 89:379-314, 2024. https://doi.org/10.1007/s10898-023-01356-y  

154. Marcia Fampa, Jon Lee. An outer-approximation algorithm for maximum-entropy sampling. In: Ljubić, I., Barahona, F., Dey, S.S., Mahjoub, A.R. (eds) Combinatorial Optimization. ISCO 2022. Lecture Notes in Computer Science, vol 13526. https://doi.org/10.1007/978-3-031-18530-4_10 

155. Marcia Fampa, Jon Lee. An outer-approximation algorithm for maximum-entropy sampling. Discrete Applied Mathematics,  347:271-284, 2024. https://doi.org/10.1016/j.dam.2024.01.002 

156. Elisabeth Gaar, Jon Lee, Ivana Ljubić, Markus Sinnl, Kübra Tanınmış. SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. Mathematical Programming, Series B. https://doi.org/10.1007/s10107-023-01965-1 

157. Gabriel Ponte, Marcia Fampa, Jon Lee. Exact and heuristic solution approaches for the D-Optimality problem. SBPO-2022, Proceedings of the LIV Simpósio Brasileiro de Pesquisa Operacional, SOBRAPO, November 2022. https://proceedings.science/sbpo-2022/trabalhos/exact-and-heuristic-solution-approaches-for-the-d-optimality-problem 

158. Yongchun Li, Marcia Fampa, Jon Lee, Feng Qiu, Weijun Xie, Rui Yao. D-optimal data fusion: exact and approximation algorithms. INFORMS Journal on Computing, 36(1):97-120, 2023.  https://doi.org/10.1287/ijoc.2022.0235 

159. Steffen Borgwardt, Weston Grewe, Jon Lee. On the combinatorial diameters of parallel and series connections. SIAM Journal on Discrete Mathematics, 38(1):485-503, 2024. https://doi.org/10.1137/22M1490508   

160. Zhongzhu Chen, Marcia Fampa, Jon Lee. Generalized scaling for the constrained maximum-entropy sampling problem. To appear in Mathematical Programming. https://arxiv.org/abs/2306.14661  (Extension of ACDA 2023 paper).

161. Gabriel Ponte, Marcia Fampa, Jon Lee. Branch-and-bound for integer D-Optimality with fast local search and variable-bound tightening https://arxiv.org/abs/2309.00117 (Extension of SBPO 2022 paper).

162. Luze Xu, Jon Lee. Gaining or losing perspective for convex multivariate functions on box domains. Mathematical Programming, Series B. https://doi.org/10.1007/s10107-024-02087-y 

163. Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu. On computing sparse generalized inverses. Operations Research Letters, 52:107058, 2024.  https://doi.org/10.1016/j.orl.2023.107058  

164. Gabriel Ponte, Marcia Fampa, Jon Lee. Convex relaxation for the generalized maximum-entropy sampling problem. Proceedings of the 22nd International Symposium on Experimental Algorithms (SEA 2024), Leibniz International Proceedings in Informatics (LIPIcs), vol. 301, Leo Liberti, ed., Article No. 25 (14 pages) https://doi.org/10.4230/LIPIcs.SEA.2024.25 .

165. Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu. Good and fast row-sparse ah-symmetric reflexive generalized inverses. https://arxiv.org/abs/2401.17540  

166. Steffen Borgwardt, Weston Grewe, Sean Kafer, Jon Lee, Laura Sanità. On the hardness of short and sign-compatible circuit walks. https://arxiv.org/abs/2402.01066  

167. Steffen Borgwardt, Weston Grewe, Jon Lee. On the diameter of a 2-sum of polyhedra.  https://arxiv.org/abs/2311.02047 

168. Gabriel Ponte, Marcia Fampa, Jon Lee. Convex relaxation for the generalized maximum-entropy sampling problem. https://arxiv.org/abs/2404.01390  (Extension of SEA 2024 paper).

You can get Math Reviews and BibTeX citations for many of my papers from the MathSciNet of the AMS.

ORCID: 0000-0002-8190-1091

My Google Scholar page is another source.

Books 

1. Jon Lee, "A First Course in Combinatorial Optimization", Cambridge University Press, February 2004. eBook, ISBN: 9780511189678. Hardback, ISBN: 0521811511. Paperback, ISBN: 0521010128. -> shop.

2. Jon Lee, "A First Course in Linear Optimization", Fourth Edition, Version 4.08 (https://github.com/jon77lee/JLee_LinearOptimizationBook/blob/master/JLee.4.08.7z), Reex Press, 2013-24) and associated software (https://github.com/jon77lee/JLee_LinearOptimizationBook/blob/master/JLee.4.08.software.zip) [Jupyter Notebooks using Python and Gurobi].

3. Marcia Fampa, Jon Lee. “Maximum-Entropy Sampling: Algorithms and Application”. Springer Series in Operations Research and Financial Engineering. October 2022. https://link.springer.com/book/9783031130779. -> shop.

Edited volumes

1. Serkan Hosten, Jon Lee, Rekha Thomas, Editors. "Trends in Optimization". Proceedings of Symposia in Applied Mathematics, Volume 61. American Mathematical Society, 2004, 140 pp., Hardback: ISBN 0-8218-3584-X.

2. Jon Lee, Adam Letchford, Guest Editors. "Mixed Integer Programming, IMA Special Workshop on Mixed-Integer Programming", Special volume of: Discrete Optimization (Volume 4, Issue 1, Pages 1-142, 2007). 

3. Jon Lee, Sven Leyffer, Editors. "Mixed Integer Nonlinear Programming". The IMA Volumes in Mathematics and its Applications, Vol. 154. 1st Edition., 2012, X, 660 p. 1 illus. Hardback, ISBN 978-1-4614-1926-6.

4. Jon Lee, Jens Vygen, Editors. "Integer Programming and Combinatorial Optimization". 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014, Proceedings. Springer, Lecture Notes in Computer Science, Vol. 8494. ISBN 978-3-319-07556-3.

5. Jon Lee, Jens Vygen, Editors. Mathematical Programming, Series B. Issue 1-2, December 2015. "Special Issue: Integer Programming and Combinatorial Optimization, 2014." ISSN: 0025-5610 (Print) 1436-4646 (Online). 

6. Jon Lee, Ridha Mahjoub, Giovanni Rinaldi, Eds. Combinatorial Optimization. 5th International Symposium on Combinatorial Optimization, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Proceedings. Springer, Lecture Notes in Computer Science, volume 10856, 2018. ISBN 978-3-319-96150-7.

7. Jon Lee, Ridha Mahjoub, Giovanni Rinaldi, Eds. “Combinatorial Optimization”. Special issue of Discrete Applied Mathematics, Volume 308, 2022. doi: 10.1016/j.dam.2021.12.012 

Patents

1. Iyengar, Vijay; Lee, Jonathan. “Method of ranking items using efficient queries", United States Patent 6,721,737 B2. Issued April 13, 2004.

2. Lee, Jonathan. “Method and apparatus for generating profile of solutions trading off number of activities utilized and objective value for bilinear integer optimization models", United States Patent 8,265,971 B2. Issued September 11, 2012.

3. Bagheri, Saeed; Barahona, Francisco; Ladanyi, Laszlo; Lee, Jonathan; Melville, David O.; Rosenbluth, Alan E.; Scarpazza, Daniele P.; Szeto-Millstone, Marc A.; Tian, Kehan; Waechter, Andreas. “Dynamic provisional decomposition of lithographic patterns having different interaction ranges”, United States Patent 8,266,554 B2. Issued September 11, 2012.

4. Masaharu Sakamoto, Alan E. Rosenbluth, Marc Alan Szeto-Millstone, Tadanobu Inoue, Kehan Tian, Andreas Waechter, Jonathan Lee, David Osmond Melville. “Optimizing lithographic mask for manufacturability in efficient manner", United States Patent 8,719,735 B2. Issued May 6, 2014.