Turán's Triangle Theorem and Binary Matroids. - Jon Lee 001 (Eur. J. Comb., 1989)

Canonical equation sets for classes of concordant polytopes. - Jon Lee 001 (Discret. Appl. Math., 1990)

The incidence structure of subspaces with well-scaled frames. - Jon Lee 001 (J. Comb. Theory B, 1990)

Characterizations of the Dimension for Classes of Concordant Polytopes. - Jon Lee 001 (Math. Oper. Res., 1990)

A Spectral Approach to Polyhedral Dimension. - Jon Lee 001 (Math. Program., 1990)

Matroid Applications and Algorithms. - Jon Lee 001; Jennifer Ryan (INFORMS J. Comput., 1992)

On Constrained Bottleneck Extrema. - Jon Lee 001 (Oper. Res., 1992)

Crashing a maximum-weight complementary basis. - Kurt M. Anstreicher; Jon Lee 001; Thomas F. Rutherford (Math. Program., 1992)

Order selection on a single machine with high set-up costs. - Brenda L. Dietrich; Jon Lee 001; Yew Sing Lee (Ann. Oper. Res., 1993)

A comparison of two edge-coloring formulations. - Jon Lee 001; Janny Leung (Oper. Res. Lett., 1993)

Geometric Comparison of Combinatorial Polytopes. - Jon Lee 001; Walter D. Morris Jr. (Discret. Appl. Math., 1994)

More facets from fences for linear ordering and acyclic subgraph polytopes. - Janny Leung; Jon Lee 001 (Discret. Appl. Math., 1994)

Local bipartite turán graphs and graph partitioning. - Jon Lee 001; Jennifer Ryan (Networks, 1994)

An Exact Algorithm for Maximum Entropy Sampling. - Chun-Wa Ko; Jon Lee 001; Maurice Queyranne (Oper. Res., 1995)

Continuous Relaxations for Constrained Maximum-Entropy Sampling. - Kurt M. Anstreicher; Marcia Fampa; Jon Lee 001; Joy Williams (IPCO, 1996)

The volume of relaxed Boolean-quadric and cut polytopes. - Chun-Wa Ko; Jon Lee 001; Einar Steingrímsson (Discret. Math., 1997)

Classroom Note: Hoffman's Circle Untangled. - Jon Lee 001 (SIAM Rev., 1997)

On the boolean-quadric packinguncapacitated facility-location polytope. - Jill Hardin; Jon Lee 001; Janny Leung (Ann. Oper. Res., 1998)

Constrained Maximum-Entropy Sampling. - Jon Lee 001 (Oper. Res., 1998)

Orienting Matroids Representable Over Both GF(3) and GF(5). - Jon Lee 001 (Eur. J. Comb., 1999)

A Characterization of the Orientations of Ternary Matroids. - Jon Lee 001; Matt Scobee (J. Comb. Theory B, 1999)

Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems. - Kurt M. Anstreicher; Marcia Fampa; Jon Lee 001; Joy Williams (Math. Program., 1999)

Evaluating multiple attribute items using queries. - Vijay S. Iyengar; Jon Lee 001; Murray Campbell (EC, 2001)

Maximum-entropy remote sampling. - Kurt M. Anstreicher; Marcia Fampa; Jon Lee 001; Joy Williams (Discret. Appl. Math., 2001)

Polyhedral methods for piecewise-linear functions I: the lambda method. - Jon Lee 001; Dan Wilson (Discret. Appl. Math., 2001)

All-Different Polytopes. - Jon Lee 001 (J. Comb. Optim., 2002)

Cropped Cubes. - Jon Lee 001 (J. Comb. Optim., 2003)

A linear integer programming bound for maximum-entropy sampling. - Jon Lee 001; Joy Williams (Math. Program., 2003)

More on a Binary-Encoded Coloring Formulation. - Jon Lee 001; François Margot (IPCO, 2004)

Min-up/min-down polytopes. - Jon Lee 001; Janny Leung; François Margot (Discret. Optim., 2004)

Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem. - Laszlo Ladányi; Jon Lee 001; Robin Lougee-Heimer (Ann. Oper. Res., 2005)

Parsimonious binary-encoding in integer programming. - Don Coppersmith; Jon Lee 001 (Discret. Optim., 2005)

Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. - Jon Lee 001; Janny Leung; Sven de Vries (J. Comb. Optim., 2005)

An MINLP Solution Method for a Water Network Problem. - Cristiana Bragalli; Claudia D'Ambrosio; Jon Lee 001; Andrea Lodi 001; Paolo Toth (ESA, 2006)

Using AMPL for Teaching the TSP. - Jon Lee 001; John F. Raffensperger (INFORMS Trans. Educ., 2006)

In situ column generation for a cutting-stock problem. - Jon Lee 001 (Comput. Oper. Res., 2007)

Mixed integer programming. - Jon Lee 001; Adam N. Letchford (Discret. Optim., 2007)

Mixed-integer nonlinear programming: Some modeling and solution issues. - Jon Lee 001 (IBM J. Res. Dev., 2007)

On a Binary-Encoded ILP Coloring Formulation. - Jon Lee 001; François Margot (INFORMS J. Comput., 2007)

Solving maximum-entropy sampling problems using factored masks. - Samuel Burer; Jon Lee 001 (Math. Program., 2007)

Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. - Anureet Saxena; Pierre Bonami; Jon Lee 001 (IPCO, 2008)

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility. - Jesús A. De Loera; Jon Lee 001; Peter N. Malkin; Susan Margulies (ISSAC, 2008)

An algorithmic framework for convex mixed integer nonlinear programs. - Pierre Bonami; Lorenz T. Biegler; Andrew R. Conn; Gérard Cornuéjols; Ignacio E. Grossmann; Carl D. Laird; Jon Lee 001; Andrea Lodi 001; François Margot; Nicolas W. Sawaya; Andreas Wächter (Discret. Optim., 2008)

On test sets for nonlinear integer maximization. - Jon Lee 001; Shmuel Onn; Robert Weismantel (Oper. Res. Lett., 2008)

Nonlinear Matroid Optimization and Experimental Design. - Yael Berstein; Jon Lee 001; Hugo Maruri-Aguilar; Shmuel Onn; Eva Riccomagno; Robert Weismantel; Henry P. Wynn (SIAM J. Discret. Math., 2008)

Nonlinear Optimization over a Weighted Independence System. - Jon Lee 001; Shmuel Onn; Robert Weismantel (AAIM, 2009)

On the Boundary of Tractability for Nonlinear Discrete Optimization. - Jon Lee 001 (CTW, 2009)

A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. - Claudia D'Ambrosio; Jon Lee 001; Andreas Wächter (ESA, 2009)

Non-monotone submodular maximization under matroid and knapsack constraints. - Jon Lee 001; Vahab S. Mirrokni; Viswanath Nagarajan; Maxim Sviridenko (STOC, 2009)

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. - Jesús A. De Loera; Jon Lee 001; Susan Margulies; Shmuel Onn (Comb. Probab. Comput., 2009)

Computation in multicriteria matroid optimization. - Jesús A. De Loera; David C. Haws; Jon Lee 001; Allison O'Hair (ACM J. Exp. Algorithmics, 2009)

Branching and bounds tighteningtechniques for non-convex MINLP. - Pietro Belotti; Jon Lee 001; Leo Liberti; François Margot; Andreas Wächter (Optim. Methods Softw., 2009)

Approximate Nonlinear Optimization over Weighted Independence Systems. - Jon Lee 001; Shmuel Onn; Robert Weismantel (SIAM J. Discret. Math., 2009)

Nonlinear Integer Programming. - Raymond Hemmecke; Matthias Köppe; Jon Lee 001; Robert Weismantel (50 Years of Integer Programming, 2010)

Feasibility-Based Bounds Tightening via Fixed Points. - Pietro Belotti; Sonia Cafieri; Jon Lee 001; Leo Liberti (COCOA (1), 2010)

On the Convergence of Feasibility based Bounds Tightening. - Pietro Belotti; Sonia Cafieri; Jon Lee 001; Leo Liberti (CTW, 2010)

Intractability of approximate multi-dimensional nonlinear optimization on independence systems. - Jon Lee 001; Shmuel Onn; Robert Weismantel (CoRR, 2010)

On convex relaxations of quadrilinear terms. - Sonia Cafieri; Jon Lee 001; Leo Liberti (J. Glob. Optim., 2010)

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. - Jon Lee 001; Maxim Sviridenko; Jan Vondrák (Math. Oper. Res., 2010)

Parametric nonlinear discrete optimization over well-described sets and matroid intersections. - Yael Berstein; Jon Lee 001; Shmuel Onn; Robert Weismantel (Math. Program., 2010)

Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. - Anureet Saxena; Pierre Bonami; Jon Lee 001 (Math. Program., 2010)

Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization. - John A. Gunnels; Jon Lee 001; Susan Margulies (Math. Program. Comput., 2010)

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. - Jon Lee 001; Vahab S. Mirrokni; Viswanath Nagarajan; Maxim Sviridenko (SIAM J. Discret. Math., 2010)

On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem. - Leo Liberti; Benoît Masson; Jon Lee 001; Carlile Lavor; Antonio Mucherino (COCOA, 2011)

A Probing Algorithm for MINLP with Failure Prediction by SVM. - Giacomo Nannicini; Pietro Belotti; Jon Lee 001; Jeff T. Linderoth; François Margot; Andreas Wächter (CPAIOR, 2011)

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz. - Jesús A. De Loera; Jon Lee 001; Peter N. Malkin; Susan Margulies (J. Symb. Comput., 2011)

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. - Anureet Saxena; Pierre Bonami; Jon Lee 001 (Math. Program., 2011)

A matroid view of key theorems for edge-swapping algorithms. - Jon Lee 001; Leo Liberti (Math. Methods Oper. Res., 2012)

The quadratic Graver cone, quadratic integer minimization, and extensions. - Jon Lee 001; Shmuel Onn; Lyubov Romanchuk; Robert Weismantel (Math. Program., 2012)

Discretization orders for distance geometry problems. - Carlile Lavor; Jon Lee 001; Audrey Lee-St. John; Leo Liberti; Antonio Mucherino; Maxim Sviridenko (Optim. Lett., 2012)

Systems of Polynomials for Detecting Orientable Matroids. - Jesús A. De Loera; Jon Lee 001; Susan Margulies; Jacob Miller 002 (Electron. Notes Discret. Math., 2013)

Optimizing the Assignment of Students to Classes in an Elementary School. - Binyamin Krauss; Jon Lee 001; Daniel Newman (INFORMS Trans. Educ., 2013)

On branching rules for convex mixed-integer nonlinear optimization. - Pierre Bonami; Jon Lee 001; Sven Leyffer; Andreas Wächter (ACM J. Exp. Algorithmics, 2013)

Matroid Matching: The Power of Local Search. - Jon Lee 001; Maxim Sviridenko; Jan Vondrák (SIAM J. Comput., 2013)

On the number of realizations of certain Henneberg graphs arising in protein conformation. - Leo Liberti; Benoît Masson; Jon Lee 001; Carlile Lavor; Antonio Mucherino (Discret. Appl. Math., 2014)

Optimal rank-sparsity decomposition. - Jon Lee 001; Bai Zou (J. Glob. Optim., 2014)

On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space. - Claudia D'Ambrosio; Marcia Fampa; Jon Lee 001; Stefan Vigerske (SEA, 2015)

Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers. - Andrew Orso; Jon Lee 001; Siqian Shen (SEA, 2015)

Weak orientability of matroids and polynomial equations. - Jesús A. De Loera; Jon Lee 001; Susan Margulies; Jacob Miller 002 (Eur. J. Comb., 2015)

An algebraic-perturbation variant of Barvinok's algorithm. - Jon Lee 001; Daphne E. Skipper (Electron. Notes Discret. Math., 2015)

Preface. - Jon Lee 001; Jens Vygen (Math. Program., 2015)

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond. - Jesús A. De Loera; Raymond Hemmecke; Jon Lee 001 (SIAM J. Optim., 2015)

Max-Cut Under Graph Constraints. - Jon Lee 001; Viswanath Nagarajan; Xiangkun Shen (IPCO, 2016)

Low-Rank/Sparse-Inverse Decomposition via Woodbury. - Victor K. Fuentes; Jon Lee 001 (OR, 2016)

A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space. - Marcia Fampa; Jon Lee 001; Wendel Melo (Comput. Optim. Appl., 2016)

Extended Formulations for Independence Polytopes of Regular Matroids. - Volker Kaibel; Jon Lee 001; Matthias Walter; Stefan Weltge (Graphs Comb., 2016)

An overview of exact algorithms for the Euclidean Steiner tree problem in n-space. - Marcia Fampa; Jon Lee 001; Nelson Maculan (Int. Trans. Oper. Res., 2016)

Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations. - Emily Speakman; Han Yu; Jon Lee 001 (CPAIOR, 2017)

On global optimization with indefinite quadratics. - Marcia Fampa; Jon Lee 001; Wendel Melo (EURO J. Comput. Optim., 2017)

Another pedagogy for mixed-integer Gomory. - Jon Lee 001; Angelika Wiegele (EURO J. Comput. Optim., 2017)

Virtuous smoothing for global optimization. - Jon Lee 001; Daphne E. Skipper (J. Glob. Optim., 2017)

Quantifying Double McCormick. - Emily Speakman; Jon Lee 001 (Math. Oper. Res., 2017)

Another pedagogy for pure-integer Gomory. - Qi He; Jon Lee 001 (RAIRO Oper. Res., 2017)

On Sparse Reflexive Generalized Inverses. - Marcia Fampa; Jon Lee 001 (CoRR, 2018)

Computing with an algebraic-perturbation variant of Barvinok's algorithm. - Jon Lee 001; Daphne E. Skipper (Discret. Appl. Math., 2018)

On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation. - Emily Speakman; Jon Lee 001 (J. Glob. Optim., 2018)

Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations. - Jon Lee 001; Daphne E. Skipper; Emily Speakman (Math. Program., 2018)

Approximating graph-constrained max-cut. - Xiangkun Shen; Jon Lee 001; Viswanath Nagarajan (Math. Program., 2018)

On sparse reflexive generalized inverse. - Marcia Fampa; Jon Lee 001 (Oper. Res. Lett., 2018)

Approximating max-cut under graph-MSO constraints. - Martin Koutecký; Jon Lee 001; Viswanath Nagarajan; Xiangkun Shen (Oper. Res. Lett., 2018)

Diving for Sparse Partially-Reflexive Generalized Inverses. - Victor K. Fuentes; Marcia Fampa; Jon Lee 001 (WCGO, 2019)

On Proximity for k-Regular Mixed-Integer Linear Optimization. - Luze Xu; Jon Lee 001 (WCGO, 2019)

More Virtuous Smoothing. - Luze Xu; Jon Lee 001; Daphne E. Skipper (SIAM J. Optim., 2019)

Handling Separable Non-convexities Using Disjunctive Cuts. - Claudia D'Ambrosio; Jon Lee 001; Daphne E. Skipper; Dimitri Thomopulos (ISCO, 2020)

Improving Proximity Bounds Using Sparsity. - Jon Lee 001; Joseph Paat; Ingo Stallknecht; Luze Xu (ISCO, 2020)

Volume computation for sparse Boolean quadric relaxations. - Jon Lee 001; Daphne E. Skipper (Discret. Appl. Math., 2020)

Correction to: Extended Formulations for Independence Polytopes of Regular Matroids. - Volker Kaibel; Jon Lee 001; Matthias Walter; Stefan Weltge (Graphs Comb., 2020)

Generalized maximum-entropy sampling. - Jon Lee 001; Joy Lind (INFOR Inf. Syst. Oper. Res., 2020)

On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. - Claudia D'Ambrosio; Marcia Fampa; Jon Lee 001; Stefan Vigerske (Optim. Lett., 2020)

On an SDP relaxation for kissing number. - Jon Lee 001; Leo Liberti (Optim. Lett., 2020)

An R Package for Generating Covariance Matrices for Maximum-Entropy Sampling from Precipitation Chemistry Data. - Hessa Al-Thani; Jon Lee 001 (Oper. Res. Forum, 2020)

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs. - Yan Deng; Huiwen Jia; Shabbir Ahmed 001; Jon Lee 001; Siqian Shen (INFORMS J. Comput., 2021)

Convexification of bilinear forms through non-symmetric lifting. - Marcia Fampa; Jon Lee 001 (J. Glob. Optim., 2021)

Experimental analysis of local searches for sparse reflexive generalized inverses. - Marcia Fampa; Jon Lee 001; Gabriel Ponte; Luze Xu (J. Glob. Optim., 2021)

Mixing convex-optimization bounds for maximum-entropy sampling. - Zhongzhu Chen; Marcia Fampa; Amélie Lambert; Jon Lee 001 (Math. Program., 2021)

Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. - Marcia Fampa; Jon Lee 001; Gabriel Ponte (Open J. Math. Optim., 2021)

Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search. - Luze Xu; Marcia Fampa; Jon Lee 001; Gabriel Ponte (SIAM J. Optim., 2021)

SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. - Elisabeth Gaar; Jon Lee 001; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (IPCO, 2022)

Preface: Combinatorial Optimization ISCO 2018. - Jon Lee 001; Ali Ridha Mahjoub; Giovanni Rinaldi (Discret. Appl. Math., 2022)

Gaining or losing perspective. - Jon Lee 001; Daphne E. Skipper; Emily Speakman (J. Glob. Optim., 2022)

On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem. - Zhongzhu Chen; Marcia Fampa; Jon Lee 001 (INFORMS J. Comput., 2023)

Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions. - Jon Lee 001; Daphne E. Skipper; Emily Speakman; Luze Xu (J. Optim. Theory Appl., 2023)

Polynomial Upper Bounds on the Number of Differing Columns of ?-Modular Integer Programs. - Jon Lee 001; Joseph Paat; Ingo Stallknecht; Luze Xu (Math. Oper. Res., 2023)

Tridiagonal maximum-entropy sampling and tridiagonal masks. - Hessa Al-Thani; Jon Lee 001 (Discret. Appl. Math., 2023)

On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. - Claudia D'Ambrosio; Marcia Fampa; Jon Lee 001; Felipe Sinnecker (ISCO, 2024)

On Disjunction Convex Hulls by Lifting. - Yushan Qu; Jon Lee 001 (ISCO, 2024)

Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem. - Gabriel Ponte; Marcia Fampa; Jon Lee 001 (SEA, 2024)

Computing Experiment-Constrained D-Optimal Designs. - Aditya Pillai; Gabriel Ponte; Marcia Fampa; Jon Lee 001; Mohit Singh; Weijun Xie 001 (CoRR, 2024)

An outer-approximation algorithm for maximum-entropy sampling. - Marcia Fampa; Jon Lee 001 (Discret. Appl. Math., 2024)

D-Optimal Data Fusion: Exact and Approximation Algorithms. - Yongchun Li; Marcia Fampa; Jon Lee 001; Feng Qiu; Weijun Xie 001; Rui Yao (INFORMS J. Comput., 2024)

Technical Note - Masking Anstreicher's linx Bound for Improved Entropy Bounds. - Zhongzhu Chen; Marcia Fampa; Jon Lee 001 (Oper. Res., 2024)

On computing sparse generalized inverses. - Gabriel Ponte; Marcia Fampa; Jon Lee 001; Luze Xu (Oper. Res. Lett., 2024)

On the Combinatorial Diameters of Parallel and Series Connections. - Steffen Borgwardt; Weston Grewe; Jon Lee 001 (SIAM J. Discret. Math., 2024)

Gaining or losing perspective for convex multivariate functions on a simplex. - Luze Xu; Jon Lee 001 (J. Glob. Optim., 2024)

On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. - Elisabeth Gaar; Jon Lee 001; Ivana Ljubic; Markus Sinnl; Kübra Taninmis (Math. Program., 2024)

On the hardness of short and sign-compatible circuit walks. - Steffen Borgwardt; Weston Grewe; Sean Kafer; Jon Lee 001; Laura Sanità (Discret. Appl. Math., 2025)

On disjunction convex hulls by big-M lifting. - Yushan Qu; Jon Lee 001 (Discret. Appl. Math., 2025)

Gaining or losing perspective for convex multivariate functions on box domains. - Luze Xu; Jon Lee 001 (Math. Program., 2025)

Recent Advances in Maximum-Entropy Sampling. - Marcia Fampa; Jon Lee 001 (CoRR, 2025)

Generalized scaling for the constrained maximum-entropy sampling problem. - Zhongzhu Chen; Marcia Fampa; Jon Lee 001 (Math. Program., 2025)

On the diameter of a 2-sum of polyhedra. - Steffen Borgwardt; Weston Grewe; Jon Lee 001 (Optim. Lett., 2025)