Jon Lee (mathematician)

Last updated

Jon Lee (born 1960) is an American mathematician and operations researcher, the G. Lawton and Louise G. Johnson Professor of Engineering at the University of Michigan. [1] He is known for his research in nonlinear discrete optimization and combinatorial optimization. [2]

Contents

Biography

Lee graduated from Stuyvesant High School in 1977. He did both his undergraduate and graduate studies at Cornell University, earning a bachelor's degree in 1981 and a Ph.D. in 1986 under the supervision of Robert G. Bland. [3] Lee was a faculty member at Yale University from 1985 until 1993, when he moved to the mathematics department at the University of Kentucky. From 2000 to 2011, he worked at the IBM Thomas J. Watson Research Center, after which he returned to academia at the University of Michigan. [2] From 2010 through 2012, Lee was chair of the INFORMS Optimization Society. [4] In 2018–2021, Lee was Editor-in-Chief of the journal Mathematical Programming, Series A. [5]

Books

Lee is the author of A First Course in Combinatorial Optimization (Cambridge University Press, 2004) and A First Course in Linear Optimization (Reex Press, 2013). He is co-author, with Marcia Fampa, of Maximum-Entropy Sampling: Algorithms and Application (Springer, 2022). He is co-editor of: Trends in Optimization (American Mathematical Society, 2004), Mixed Integer Nonlinear Programming (Springer, 2012), Integer Programming and Combinatorial Optimization (Lecture Notes in Computer Science, Vol. 8494; Springer, 2014), Special Issue: Integer Programming and Combinatorial Optimization, 2014 (Mathematical Programming, Series B. Issue 1-2, December 2015), and Combinatorial Optimization (Lecture Notes in Computer Science, Vol. 10856; Springer, 2018).

Awards and honors

In 2010, Lee and his co-authors won the ICS Prize of the INFORMS Computing Society for their work showing that many combinatorial feasibility problems could be recast as systems of polynomial equations in complex variables and then shown to be infeasible by applying Hilbert's Nullstellensatz and a wide variety of computational techniques. [6]

In 2013, Lee was elected as a Fellow of INFORMS. [7]

Related Research Articles

<span class="mw-page-title-main">Combinatorial optimization</span> Subfield of mathematical optimization

Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead.

In computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, tune, or select a heuristic that may provide a sufficiently good solution to an optimization problem or a machine learning problem, especially with incomplete or imperfect information or limited computation capacity. Metaheuristics sample a subset of solutions which is otherwise too large to be completely enumerated or otherwise explored. Metaheuristics may make relatively few assumptions about the optimization problem being solved and so may be usable for a variety of problems.

<span class="mw-page-title-main">Éva Tardos</span> Hungarian mathematician

Éva Tardos is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University.

<span class="mw-page-title-main">Christos Papadimitriou</span> Greek computer scientist (b. 1949)

Christos Charilaos Papadimitriou is a Greek theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.

<span class="mw-page-title-main">Jack Edmonds</span> American/Canadian mathematician and computer scientist

Jack R. Edmonds is an American-born and educated computer scientist and mathematician who lived and worked in Canada for much of his life. He has made fundamental contributions to the fields of combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John von Neumann Theory Prize.

<span class="mw-page-title-main">Eduardo D. Sontag</span> Argentine American mathematician

Eduardo Daniel Sontag is an Argentine-American mathematician, and distinguished university professor at Northeastern University, who works in the fields control theory, dynamical systems, systems molecular biology, cancer and immunology, theoretical computer science, neural networks, and computational biology.

<span class="mw-page-title-main">Jaroslav Nešetřil</span> Czech mathematician

Jaroslav (Jarik) Nešetřil is a Czech mathematician, working at Charles University in Prague. His research areas include combinatorics, graph theory, algebra, posets, computer science.

Thomas Lee Magnanti is an American engineer and Institute Professor and former Dean of the School of Engineering at the Massachusetts Institute of Technology.

Ellis Lane Johnson is the Professor Emeritus and the Coca-Cola Chaired Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Institute of Technology in Atlanta, Georgia.

<span class="mw-page-title-main">Fred W. Glover</span> American computer scientist

Fred Glover is Chief Scientific Officer of Entanglement, Inc., USA, in charge of algorithmic design and strategic planning for applications of combinatorial optimization in quantum computing. He also holds the title of Distinguished University Professor, Emeritus, at the University of Colorado, Boulder, associated with the College of Engineering and Applied Science and the Leeds School of Business. He is known for his innovations in the area of metaheuristics including the computer-based optimization methodology of Tabu search an adaptive memory programming algorithm for mathematical optimization, and the associated evolutionary Scatter Search and Path Relinking algorithms.

Eugene Leighton (Gene) Lawler was an American computer scientist and a professor of computer science at the University of California, Berkeley.

<span class="mw-page-title-main">Michel Goemans</span> Belgian-American mathematician

Michel Xavier Goemans is a Belgian-American professor of applied mathematics and the RSA Professor of Mathematics at MIT working in discrete mathematics and combinatorial optimization at CSAIL and MIT Operations Research Center.

<span class="mw-page-title-main">George Nemhauser</span> American operations researcher (born 1937)

George Lann Nemhauser is an American operations researcher, the A. Russell Chandler III Chair and Institute Professor of Industrial and Systems Engineering at the Georgia Institute of Technology and the former president of the Operations Research Society of America.

<span class="mw-page-title-main">Alexander Schrijver</span> Dutch mathematician and computer scientist

Alexander (Lex) Schrijver is a Dutch mathematician and computer scientist, a professor of discrete mathematics and optimization at the University of Amsterdam and a fellow at the Centrum Wiskunde & Informatica in Amsterdam. Since 1993 he has been co-editor in chief of the journal Combinatorica.

<span class="mw-page-title-main">Laurence Wolsey</span>

Laurence Alexander Wolsey is a Belgian-English mathematician working in the field of integer programming. His mother Anna Wolsey-Mautner was the daughter of the Viennese Industrialist Konrad David Mautner. He is a former president and research director of the Center for Operations Research and Econometrics (CORE) at Université catholique de Louvain in Belgium. He is professor emeritus of applied mathematics at the engineering school of the same university.

<span class="mw-page-title-main">Gérard Cornuéjols</span> American mathematician

Gérard Pierre Cornuéjols is the IBM University Professor of Operations Research in the Carnegie Mellon University Tepper School of Business and professor at Aix-Marseille University. His research interests include facility location, integer programming, balanced matrices, and perfect graphs.

Daniel Mier Gusfield is an American computer scientist, Distinguished Professor of Computer Science at the University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology.

Pascal Van Hentenryck is the A. Russell Chandler III Chair and Professor of Industrial and Systems Engineering at Georgia Tech. He is credited with pioneering advances in constraint programming and stochastic optimization, bridging theory and practice to solve real-world problems across a range of domains including sports scheduling, protein folding, kidney matching, disaster relief, power systems, recommender systems, and transportation. He has developed several optimization technologies including CHIP, Numerica, the Optimization Programming Language, and Comet. He has also published several books, including Online Stochastic Combinatorial Optimization, Hybrid Optimization, and Constraint-Based Local Search.

Maria Grazia Speranza is an Italian applied mathematician and operations researcher. Her research involves the application of mathematical optimization to problems including portfolio optimization and the combination of inventory management with vehicle routing.

<span class="mw-page-title-main">Shmuel Onn</span> Israeli mathematician

Shmuel Onn is a mathematician, Professor of Operations Research and Dresner Chair at the Technion - Israel Institute of Technology. He is known for his contributions to integer programming and nonlinear combinatorial optimization.

References

  1. Summary of Personnel Actions, Regents of the University of Michigan, October 2011, retrieved 2012-02-25.
  2. 1 2 Faculty appointment dossier at Univ. of Michigan, September 2011, retrieved 2012-02-25.
  3. Jonathan Lee at the Mathematics Genealogy Project
  4. INFORMS Optimization Society, Officers, INFORMS, retrieved 2018-01-26.
  5. Mathematical Programming (Springer).
  6. INFORMS Computing Society Prize Archived 2010-10-20 at the Wayback Machine , INFORMS Computing Society, retrieved 2018-01-25.
  7. INFORMS Fellows Class of 2013, INFORMS, retrieved 2018-01-25.