Publications

  1. Jon Lee. Turan'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 and 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, and 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, and 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 and Jennifer Ryan. Matroid applications and algorithms. INFORMS (formerly ORSA) Journal on Computing, 4(1):70-98, 1992.
  12. Brenda L. Dietrich, Jon Lee, and 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 and Janny Leung. A comparison of two edge-coloring formulations. Operations Research Letters, 13(4):215-223, 1993.
  14. Jon Lee and Walter D. Morris, Jr. Geometric comparison of combinatorial polytopes. Discrete Applied Mathematics, 55(2):163-182, 1994.
  15. Jon Lee and Jennifer Ryan. Local bipartite Turan graphs and graph partitioning. Networks, 24(3):131-145, 1994.
  16. Janny Leung and 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, and Maurice Queyranne. An exact algorithm for maximum entropy sampling. Operations Research, 43(4):684-691, 1995.
  18. T. L. Hayden, Jon Lee, Jim Wells, and 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, and 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, and 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, and 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, and Kevin Wayne. Comparison of spectral and Hadamard bounds for D-optimality. In: A.C. Atkinson, L. Pronzato, and 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 and 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, and Joy Williams. Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems. Mathematical Programming, Series A, 85:221-240, 1999.
  28. Jon Lee and 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 and 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 and Joy Williams. Maximum-entropy remote sampling. Discrete Applied Mathematics, 108:211-226, 2001.
  32. Jon Lee. Maximum entropy sampling. In: A.H. El-Shaarawi and W.W. Piegorsch, editors, "Encyclopedia of Environmetrics". Wiley, 2001.
  33. Alan Hoffman, Jon Lee and Joy Williams. New upper bounds for maximum-entropy sampling. In: A.C. Atkinson, P. Hackl and 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 and Joy Williams. Generalized maximum-entropy sampling. University of Kentucky, Department of Mathematics, Technical report No. 99-10, July 1999.
  35. Don Coppersmith, Jon Lee and Janny Leung. A polyhedron for products of linear functions in 0/1 variables. IBM Research Report RC21568, September 1999.
  36. Don Coppersmith and Jon Lee. Indivisibility and divisibility polytopes. In: "Novel Approaches to Hard Discrete Optimization" (P.M. Pardalos and H. Wolkowicz, Editors), Fields Institute Communications Series, Volume 37, American Mathematical Society, 2003, pp. 71-95.
  37. Jon Lee and 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 and 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 and 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 and 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 and François Margot. Min-up/min-down polytopes. Discrete Optimization, 1:77-85, 2004.
  44. Don Coppersmith and Jon Lee. Parsimonious binary-encoding in integer programming. Discrete Optimization, 2(3):190-200, 2005.
  45. Kurt Anstreicher and Jon Lee. A masked spectral bound for maximum-entropy sampling. In: A. Di Bucchianico, H. Läuter and H.P. Wynn, editors, "MODA 7 - Advances in Model-Oriented Design and Analysis", Contributions to Statistics, Springer, Berlin, 1-10, 2004.
  46. Jon Lee and 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 and J.F. Raffensperger, Using AMPL for teaching the TSP, INFORMS Transactions on Education, 7(1):38-70, 2006.
  48. Jon Lee and François Margot. On a binary-encoded ILP coloring formulation. INFORMS Journal on Computing, 19(3):406-415, 2007.
  49. Samuel Burer and 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, Gerard Cornuejols, 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 and T. Erlebach, Eds., pages 696-707. Springer, 2006.
  53. Oktay Gunluk, Jon Lee and 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 and 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 and 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 and 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 and 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, IBM Research Report RC24495, 02/2008.
  63. Anureet Saxena, Pierre Bonami and Jon Lee. Disjunctive cuts for non-convex mixed integer quadratically constrained programs, In: “Integer programming and combinatorial optimization (Bertinoro, 2008)“, A. Lodi, A. Panconesi, and 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. To appear in: SIAM J. on Discrete Mathematics.
  66. Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel. Parametric nonlinear discrete optimization over well-described sets and matroid intersections. To appear in: Mathematical Programming.
  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, IBM Research Report RC24621, 08/2008. To appear in: Mathematical Programming.
  69. Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Maximizing non-monotone submodular functions under matroid or knapsack constraints. To appear in: SIAM J. on Discrete Mathematics.
  70. John Gunnels, Jon Lee, Susan Margulies. Efficient high-precision dense matrix algebra on parallel architectures for nonlinear discrete optimization, IBM Research Report RC24682, 10/2008.
  71. Anureet Saxena, Pierre Bonami. Jon Lee. Convex relaxations of non-convex mixed integer quadratically constrained programs: Projected formulations, IBM Research Report RC24695, 11/2008.
  72. Sonia Cafieri, Jon Lee and Leo Liberti. Comparison of convex relaxations of quadrilinear terms, In: Global Optimization: Theory, Methods and Applications, C. Ma, L. Yu, D. Zhang and 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 and A. O’Hair, Computation in multicriteria matroid optimization. To appear in ACM Journal on Experimental Algorithmics.
  74. HOT 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.
  75. HOT Jon Lee, Maxim Sviridenko and 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.
  76. HOT Sonia Cafieri, Jon Lee and Leo Liberti. On convex relaxations of quadrilinear terms, IBM Research Report RC24792, 04/2009. To appear in the Journal of Global Optimization.
  77. HOT 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.
  78. HOT 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.
  79. HOT Claudia D'Ambrosio, Jon Lee, Andreas Wächter. An algorithmic framework for MINLP with separable non-convexity, IBM Research Report RC24810, 06/2009.
  80. HOT Raymond Hemmecke, Mathias Köppe, Jon Lee, Robert Weismantel. Nonlinear integer programming, IBM Research Report RC24820, 06/2009. To appear in: M. Jünger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50 Years of Integer Programming 1958–2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2010, ISBN 3540682740.
  81. HOT Jon Lee, Maxim Sviridenko and Jan Vondrák. Matroid Matching: the Power of Local Search, IBM Research Report RC24898, 11/2009.

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

You can get the IBM Research Reports from the IBM Research CyberDigest . If that seems like too much trouble, then just send me a request by email.

Books

  1. Serkan Hosten, Jon Lee and 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.

    Cover for Trends in Optimization

  2. Jon Lee, A First Course in Combinatorial Optimization, Cambridge University Press, February 2004. eBook, ISBN: 9780511189678. Hardback, ISBN: 0521811511. Paperback, ISBN: 0521010128. As low as $24.

    Cover for A First Course in Combinatorial Optimization

I provided the titles for:

  • A tale of two dimensional bin packing, Nikhil Bansal, Andrea Lodi, Maxim Sviridenko. Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 657-666, 2005 Publisher: IEEE Computer Society.
  • Star search - a different show, Offer Kella. Israel Journal of Mathematics Vol. 67(1-2), 145-159, 1993.

I provided the cover art for:

  • Selected Papers of Alan J. Hoffman: With Commentary, Charles A. Micchelli (Editor). August 2003, ISBN 981-02-4198-4, Publisher: World Scientific.
    circle