Jon Lee

Q: What Schools Are Affiliated With Jon Lee

Jon Lee is affiliated with the following schools: Yale University, University of Kentucky, University of Michigan, Princeton University, Stanford University, Cornell University

Jon Lee 's AcademicInfluence.com Rankings

Jon Lee

Mathematics

#7296

World Rank

#9945

Historical Rank

#2040

USA Rank

Group Theory

#438

World Rank

#508

Historical Rank

#93

USA Rank

Algebra

#720

World Rank

#943

Historical Rank

#131

USA Rank

Measure Theory

#4640

World Rank

#5434

Historical Rank

#1289

USA Rank

mathematics Degrees

Download Badge

Mathematics

Jon Lee 's Degrees

PhD Mathematics Princeton University
Masters Mathematics Stanford University

Why Is Jon Lee Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jon Lee is an American mathematician and operations researcher, the G. Lawton and Louise G. Johnson Professor of Engineering at the University of Michigan. He is known for his research in nonlinear discrete optimization and combinatorial optimization.

(See a Problem?)

Jon Lee 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

An algorithmic framework for convex mixed integer nonlinear programs (2008) (913)
Branching and bounds tighteningtechniques for non-convex MINLP (2009) (674)
Nonlinear Integer Programming (2009) (339)
Non-monotone submodular maximization under matroid and knapsack constraints (2009) (235)
Mixed Integer Nonlinear Programming (2011) (230)
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties (2009) (189)
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints (2009) (168)
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations (2010) (145)
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (2011) (107)
Min-up/min-down polytopes (2004) (92)
IBM Research Report MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL (2007) (52)
Evaluating multiple attribute items using queries (2001) (48)
Robustness evaluation for compliant assembly systems (2003) (40)
Matroid matching: the power of local search (2010) (40)
All-Different Polytopes (2002) (36)
On the problem of stochastic experimental modal analysis based on multiple-excitation multiple-response data, part II: The modal analysis approach (1993) (36)
More Branch-and-Bound Experiments in Convex Nonlinear Integer Programming (2011) (32)
Nonlinear Matroid Optimization and Experimental Design (2007) (32)
Mixed-integer nonlinear programming: Some modeling and solution issues (2007) (31)
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond (2014) (30)
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (2008) (30)
On the problem of stochastic experimental modal analysis based on multiple-excitation multiple-response data, part I: Dispersion analysis of continuous-time structural systems (1993) (29)
AN ALGORITHMIC FRAMEWORK FOR MINLP WITH SEPARABLE NON-CONVEXITY (2012) (26)
On a Binary-Encoded ILP Coloring Formulation (2007) (25)
In situ column generation for a cutting-stock problem (2007) (21)
A First Course in Combinatorial Optimization: Polytopes and Linear Programming (2004) (18)
Parametric nonlinear discrete optimization over well-described sets and matroid intersections (2010) (16)
A Probing Algorithm for MINLP with Failure Prediction by SVM (2011) (16)
Using AMPL for Teaching the TSP (2006) (16)
On branching rules for convex mixed-integer nonlinear optimization (2013) (15)
Approximate Nonlinear Optimization over Weighted Independence Systems (2009) (15)
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity (2009) (15)
Effect of cyclooxygenase‐2 inhibition on human Helicobacter pylori gastritis: mechanisms underlying gastrointestinal safety and implications for cancer chemoprevention (2003) (14)
On test sets for nonlinear integer maximization (2008) (14)
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation (2005) (11)
Nonlinear Optimization over a Weighted Independence System (2008) (10)
Parsimonious binary-encoding in integer programming (2005) (10)
SENSOR DEGRADATION DETECTION IN LINEAR SYSTEMS (2006) (9)
Nonlinear optimization for matroid intersection and extensions (2008) (9)
Cropped Cubes (2003) (9)
A First Course in Combinatorial Optimization: Appendix: Notation and Terminology (2004) (8)
On the Boundary of Tractability for Nonlinear Discrete Optimization. (2009) (8)
Trends in Optimization (2004) (7)
Computation in multicriteria matroid optimization (2009) (6)
More on a Binary-Encoded Coloring Formulation (2004) (5)
Rapid development of an open-source MINLP solver with COIN-OR (2007) (5)
Indivisibility and Divisibility Polytopes (2000) (4)
Augmentation in Linear and Integer Linear Programming (2014) (4)
Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem (2005) (4)
A First Course in Combinatorial Optimization: Branch-&-Bound (2004) (3)
Report of Focused Research Group: Nonlinear Discrete Optimization (2010) (2)
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (2021) (2)
Integer programming and combinatorial optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014, proceedings (2014) (2)
Intractability of approximate multi-dimensional nonlinear optimization on independence systems (2010) (1)
Mixed integer programming (2007) (1)
Indivisibility and divisibility polytopes (2000) (1)
A First Course in Combinatorial Optimization: Introduction (2004) (1)
Suboptimum Maximum Likelihood Identification of ARMAX Processes (1990) (1)
A First Course in Combinatorial Optimization: Preface (2004) (0)
A First Course in Combinatorial Optimization: Matroids and the Greedy Algorithm (2004) (0)
A First Course in Combinatorial Optimization: Flows and Cuts (2004) (0)
Matroid Matching : the Power of Local Search [ Extended Abstract ] (2010) (0)
Core Discussion Paper 2000/xx Indivisibility and Divisibility Polytopes (2000) (0)
A First Course in Combinatorial Optimization: References (2004) (0)
Implementation of an Exact Algorithm for a Cutting-stock Problem Using Components of COIN-OR (2003) (0)
Preface: Combinatorial Optimization ISCO 2018 (2022) (0)
A First Course in Combinatorial Optimization: Minimum-Weight Dipaths (2004) (0)
Correction to: Combinatorial Optimization (2018) (0)
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (2022) (0)
A First Course in Combinatorial Optimization: Cutting Planes (2004) (0)
Oberwolfach Preprints (2007) (0)
Trends In Optimization: American Mathematical Society Short Course, January 5-6, 2004, Phoenix, Arizona (2004) (0)
Optimizing Submodular Functions (2004) (0)
IBM Research Report Parsimonious Binary-Encoding In Integer Programming (2003) (0)
A First Course in Combinatorial Optimization: Matching (2004) (0)
IBM Research Report Nonlinear Matroid Optimization and Experimental Design (2007) (0)
A First Course in Combinatorial Optimization: Matroid Intersection (2004) (0)

This paper list is powered by the following services:

Other Resources About Jon Lee

en.wikipedia.org

What Schools Are Affiliated With Jon Lee ?

Jon Lee is affiliated with the following schools:

Jon Lee 's Academic­Influence.com Rankings

Jon Lee 's Degrees

Why Is Jon Lee Influential?

Jon Lee 's Published Works

Published Works

Other Resources About Jon Lee

What Schools Are Affiliated With Jon Lee ?

Jon Lee 's AcademicInfluence.com Rankings