Jon Lee

168 papers A* 3A 2B 12C 11Journal 131Unranked 8
YearRankTypeTitle / Venue / Authors
2026 J jnl
Convex relaxation for the generalized maximum-entropy sampling problem.
Algorithmica
Gabriel Ponte, Marcia Fampa, Jon Lee
2026 J jnl
On a geometric graph-covering problem related to optimal safety-landing-site location.
Discret. Appl. Math.
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker
2026 J jnl
The augmented NLP bound for maximum-entropy remote sampling.
CoRR
Gabriel Ponte, Marcia Fampa, Jon Lee
2025 — conf
Computing Experiment-Constrained D-Optimal Designs.
ACDA
Aditya Pillai, Gabriel Ponte, Marcia Fampa, Jon Lee, Mohit Singh, Weijun Xie
2025 J jnl
Gaining or losing perspective for convex multivariate functions on box domains.
Math. Program.
Luze Xu, Jon Lee
2025 J jnl
Generalized scaling for the constrained maximum-entropy sampling problem.
Math. Program.
Zhongzhu Chen, Marcia Fampa, Jon Lee
2025 J jnl
Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized Inverses.
Open J. Math. Optim.
Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu
2025 J jnl
On disjunction convex hulls by big-M lifting.
Discret. Appl. Math.
Yushan Qu, Jon Lee
2025 J jnl
On the diameter of a 2-sum of polyhedra.
Optim. Lett.
Steffen Borgwardt, Weston Grewe, Jon Lee
2025 J jnl
On the hardness of short and sign-compatible circuit walks.
Discret. Appl. Math.
Steffen Borgwardt, Weston Grewe, Sean Kafer, Jon Lee, Laura Sanità
2025 J jnl
On the relationship between MESP and 0/1 D-Opt and their upper bounds.
CoRR
Gabriel Ponte, Marcia Fampa, Jon Lee
2025 J jnl
Recent Advances in Maximum-Entropy Sampling.
CoRR
Marcia Fampa, Jon Lee
2024 J jnl
An outer-approximation algorithm for maximum-entropy sampling.
Discret. Appl. Math.
Marcia Fampa, Jon Lee
2024 J jnl
Computing Experiment-Constrained D-Optimal Designs.
CoRR
Aditya Pillai, Gabriel Ponte, Marcia Fampa, Jon Lee, Mohit Singh, Weijun Xie
2024 B conf
Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem.
SEA
Gabriel Ponte, Marcia Fampa, Jon Lee
2024 J jnl
D-Optimal Data Fusion: Exact and Approximation Algorithms.
INFORMS J. Comput.
Yongchun Li, Marcia Fampa, Jon Lee, Feng Qiu, Weijun Xie, Rui Yao
2024 J jnl
Gaining or losing perspective for convex multivariate functions on a simplex.
J. Glob. Optim.
Luze Xu, Jon Lee
2024 C conf
On Disjunction Convex Hulls by Lifting.
ISCO
Yushan Qu, Jon Lee
2024 J jnl
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
Math. Program.
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2024 C conf
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location.
ISCO
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker
2024 J jnl
On computing sparse generalized inverses.
Oper. Res. Lett.
Gabriel Ponte, Marcia Fampa, Jon Lee, Luze Xu
2024 J jnl
On the Combinatorial Diameters of Parallel and Series Connections.
SIAM J. Discret. Math.
Steffen Borgwardt, Weston Grewe, Jon Lee
2024 J jnl
Technical Note - Masking Anstreicher's linx Bound for Improved Entropy Bounds.
Oper. Res.
Zhongzhu Chen, Marcia Fampa, Jon Lee
2023 J jnl
Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions.
J. Optim. Theory Appl.
Jon Lee, Daphne E. Skipper, Emily Speakman, Luze Xu
2023 — conf
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem.
ACDA
Zhongzhu Chen, Marcia Fampa, Jon Lee
2023 J jnl
On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem.
INFORMS J. Comput.
Zhongzhu Chen, Marcia Fampa, Jon Lee
2023 J jnl
Polynomial Upper Bounds on the Number of Differing Columns of ?-Modular Integer Programs.
Math. Oper. Res.
Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu
2023 J jnl
Tridiagonal maximum-entropy sampling and tridiagonal masks.
Discret. Appl. Math.
Hessa Al-Thani, Jon Lee
2022 C conf
An Outer-Approximation Algorithm for Maximum-Entropy Sampling.
ISCO
Marcia Fampa, Jon Lee
2022 J jnl
Gaining or losing perspective.
J. Glob. Optim.
Jon Lee, Daphne E. Skipper, Emily Speakman
2022 J jnl
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs.
CoRR
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2022 J jnl
Preface: Combinatorial Optimization ISCO 2018.
Discret. Appl. Math.
Jon Lee, Ali Ridha Mahjoub, Giovanni Rinaldi
2022 B conf
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs.
IPCO
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2021 J jnl
Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search.
SIAM J. Optim.
Luze Xu, Marcia Fampa, Jon Lee, Gabriel Ponte
2021 J jnl
Convexification of bilinear forms through non-symmetric lifting.
J. Glob. Optim.
Marcia Fampa, Jon Lee
2021 J jnl
Experimental analysis of local searches for sparse reflexive generalized inverses.
J. Glob. Optim.
Marcia Fampa, Jon Lee, Gabriel Ponte, Luze Xu
2021 J jnl
Mixing convex-optimization bounds for maximum-entropy sampling.
Math. Program.
Zhongzhu Chen, Marcia Fampa, Amélie Lambert, Jon Lee
2021 J jnl
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs.
CoRR
Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
2021 J jnl
Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs.
INFORMS J. Comput.
Yan Deng, Huiwen Jia, Shabbir Ahmed, Jon Lee, Siqian Shen
2021 J jnl
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses.
Open J. Math. Optim.
Marcia Fampa, Jon Lee, Gabriel Ponte
2021 C conf
Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks.
LAGOS
Hessa Al-Thani, Jon Lee
2020 J jnl
An R Package for Generating Covariance Matrices for Maximum-Entropy Sampling from Precipitation Chemistry Data.
Oper. Res. Forum
Hessa Al-Thani, Jon Lee
2020 J jnl
An R Package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data.
CoRR
Hessa Al-Thani, Jon Lee
2020 J jnl
Correction to: Extended Formulations for Independence Polytopes of Regular Matroids.
Graphs Comb.
Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge
2020 J jnl
Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions.
CoRR
Jon Lee, Daphne E. Skipper, Emily Speakman, Luze Xu
2020 J jnl
Generalized maximum-entropy sampling.
INFOR Inf. Syst. Oper. Res.
Jon Lee, Joy Lind
2020 C conf
Handling Separable Non-convexities Using Disjunctive Cuts.
ISCO
Claudia D'Ambrosio, Jon Lee, Daphne E. Skipper, Dimitri Thomopulos
2020 C conf
Improving Proximity Bounds Using Sparsity.
ISCO
Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu
2020 J jnl
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs.
Optim. Lett.
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
2020 J jnl
On an SDP relaxation for kissing number.
Optim. Lett.
Jon Lee, Leo Liberti
2020 J jnl
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses.
CoRR
Marcia Fampa, Jon Lee, Gabriel Ponte
2020 J jnl
Volume computation for sparse Boolean quadric relaxations.
Discret. Appl. Math.
Jon Lee, Daphne E. Skipper
2019 — conf
Diving for Sparse Partially-Reflexive Generalized Inverses.
WCGO
Victor K. Fuentes, Marcia Fampa, Jon Lee
2019 — conf
Gaining or Losing Perspective.
WCGO
Jon Lee, Daphne E. Skipper, Emily Speakman
2019 J jnl
More Virtuous Smoothing.
SIAM J. Optim.
Luze Xu, Jon Lee, Daphne E. Skipper
2019 — conf
On Proximity for k-Regular Mixed-Integer Linear Optimization.
WCGO
Luze Xu, Jon Lee
2018 J jnl
Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations.
Math. Program.
Jon Lee, Daphne E. Skipper, Emily Speakman
2018 J jnl
Approximating Max-Cut under Graph-MSO Constraints.
CoRR
Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen
2018 J jnl
Approximating graph-constrained max-cut.
Math. Program.
Xiangkun Shen, Jon Lee, Viswanath Nagarajan
2018 J jnl
Approximating max-cut under graph-MSO constraints.
Oper. Res. Lett.
Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen
2018 C ed.
Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers
ISCO
Jon Lee, Giovanni Rinaldi, Ali Ridha Mahjoub
2018 J jnl
Computing with an algebraic-perturbation variant of Barvinok's algorithm.
Discret. Appl. Math.
Jon Lee, Daphne E. Skipper
2018 J jnl
On Sparse Reflexive Generalized Inverses.
CoRR
Marcia Fampa, Jon Lee
2018 J jnl
On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation.
J. Glob. Optim.
Emily Speakman, Jon Lee
2018 J jnl
On sparse reflexive generalized inverse.
Oper. Res. Lett.
Marcia Fampa, Jon Lee
2017 J jnl
Another pedagogy for mixed-integer Gomory.
EURO J. Comput. Optim.
Jon Lee, Angelika Wiegele
2017 J jnl
Another pedagogy for pure-integer Gomory.
RAIRO Oper. Res.
Qi He, Jon Lee
2017 B conf
Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations.
CPAIOR
Emily Speakman, Han Yu, Jon Lee
2017 J jnl
On global optimization with indefinite quadratics.
EURO J. Comput. Optim.
Marcia Fampa, Jon Lee, Wendel Melo
2017 J jnl
Quantifying Double McCormick.
Math. Oper. Res.
Emily Speakman, Jon Lee
2017 J jnl
Virtuous smoothing for global optimization.
J. Glob. Optim.
Jon Lee, Daphne E. Skipper
2016 J jnl
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in
Comput. Optim. Appl.
Marcia Fampa, Jon Lee, Wendel Melo
2016 J jnl
An overview of exact algorithms for the Euclidean Steiner tree problem in
Int. Trans. Oper. Res.
Marcia Fampa, Jon Lee, Nelson Maculan
2016 J jnl
Extended Formulations for Independence Polytopes of Regular Matroids.
Graphs Comb.
Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge
2016 — conf
Low-Rank/Sparse-Inverse Decomposition via Woodbury.
OR
Victor K. Fuentes, Jon Lee
2016 B conf
Max-Cut Under Graph Constraints.
IPCO
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
2015 J jnl
An algebraic-perturbation variant of Barvinok's algorithm.
Electron. Notes Discret. Math.
Jon Lee, Daphne E. Skipper
2015 J jnl
Extended Formulations for Independence Polytopes of Regular Matroids.
CoRR
Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge
2015 J jnl
Max-Cut under Graph Constraints.
CoRR
Jon Lee, Viswanath Nagarajan, Xiangkun Shen
2015 J jnl
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond.
SIAM J. Optim.
Jesús A. De Loera, Raymond Hemmecke, Jon Lee
2015 B conf
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space.
SEA
Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske
2015 J jnl
Preface.
Math. Program.
Jon Lee, Jens Vygen
2015 B conf
Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers.
SEA
Andrew Orso, Jon Lee, Siqian Shen
2015 J jnl
Weak orientability of matroids and polynomial equations.
Eur. J. Comb.
Jesús A. De Loera, Jon Lee, Susan Margulies, Jacob Miller
2014 B ed.
Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings
IPCO
Jon Lee, Jens Vygen
2014 J jnl
On the number of realizations of certain Henneberg graphs arising in protein conformation.
Discret. Appl. Math.
Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino
2014 J jnl
Optimal rank-sparsity decomposition.
J. Glob. Optim.
Jon Lee, Bai Zou
2013 J jnl
Matroid Matching: The Power of Local Search.
SIAM J. Comput.
Jon Lee, Maxim Sviridenko, Jan Vondrák
2013 J jnl
On branching rules for convex mixed-integer nonlinear optimization.
ACM J. Exp. Algorithmics
Pierre Bonami, Jon Lee, Sven Leyffer, Andreas Wächter
2013 J jnl
Optimizing the Assignment of Students to Classes in an Elementary School.
INFORMS Trans. Educ.
Binyamin Krauss, Jon Lee, Daniel Newman
2013 J jnl
Systems of Polynomials for Detecting Orientable Matroids.
Electron. Notes Discret. Math.
Jesús A. De Loera, Jon Lee, Susan Margulies, Jacob Miller
2012 J jnl
A matroid view of key theorems for edge-swapping algorithms.
Math. Methods Oper. Res.
Jon Lee, Leo Liberti
2012 J jnl
Discretization orders for distance geometry problems.
Optim. Lett.
Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko
2012 J jnl
The quadratic Graver cone, quadratic integer minimization, and extensions.
Math. Program.
Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel
2011 B conf
A Probing Algorithm for MINLP with Failure Prediction by SVM.
CPAIOR
Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, François Margot, Andreas Wächter
2011 J jnl
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz.
J. Symb. Comput.
Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies
2011 J jnl
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations.
Math. Program.
Anureet Saxena, Pierre Bonami, Jon Lee
2011 C conf
On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem.
COCOA
Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino
2010 J jnl
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations.
Math. Program.
Anureet Saxena, Pierre Bonami, Jon Lee
2010 J jnl
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization.
Math. Program. Comput.
John A. Gunnels, Jon Lee, Susan Margulies
2010 — conf
Feasibility-Based Bounds Tightening via Fixed Points.
COCOA (1)
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti
2010 J jnl
Intractability of approximate multi-dimensional nonlinear optimization on independence systems.
CoRR
Jon Lee, Shmuel Onn, Robert Weismantel
2010 A* conf
Matroid matching: the power of local search.
STOC
Jon Lee, Maxim Sviridenko, Jan Vondrák
2010 J jnl
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints.
SIAM J. Discret. Math.
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
2010 — ch.
Nonlinear Integer Programming.
50 Years of Integer Programming
Raymond Hemmecke, Matthias Köppe, Jon Lee, Robert Weismantel
2010 J jnl
On convex relaxations of quadrilinear terms.
J. Glob. Optim.
Sonia Cafieri, Jon Lee, Leo Liberti
2010 C conf
On the Convergence of Feasibility based Bounds Tightening.
CTW
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti
2010 J jnl
On the number of solutions of the discretizable molecular distance geometry problem
CoRR
Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino
2010 J jnl
Parametric nonlinear discrete optimization over well-described sets and matroid intersections.
Math. Program.
Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel
2010 J jnl
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.
Math. Oper. Res.
Jon Lee, Maxim Sviridenko, Jan Vondrák
2010 J jnl
The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions
CoRR
Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel
2009 A conf
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity.
ESA
Claudia D'Ambrosio, Jon Lee, Andreas Wächter
2009 J jnl
Approximate Nonlinear Optimization over Weighted Independence Systems.
SIAM J. Discret. Math.
Jon Lee, Shmuel Onn, Robert Weismantel
2009 J jnl
Branching and bounds tighteningtechniques for non-convex MINLP.
Optim. Methods Softw.
Pietro Belotti, Jon Lee, Leo Liberti, François Margot, Andreas Wächter
2009 J jnl
Computation in multicriteria matroid optimization.
ACM J. Exp. Algorithmics
Jesús A. De Loera, David C. Haws, Jon Lee, Allison O'Hair
2009 J jnl
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz.
Comb. Probab. Comput.
Jesús A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn
2009 J jnl
Non-monotone submodular maximization under matroid and knapsack constraints
CoRR
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
2009 A* conf
Non-monotone submodular maximization under matroid and knapsack constraints.
STOC
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko
2009 C conf
Nonlinear Optimization over a Weighted Independence System.
AAIM
Jon Lee, Shmuel Onn, Robert Weismantel
2009 C conf
On the Boundary of Tractability for Nonlinear Discrete Optimization.
CTW
Jon Lee
2009 — conf
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.
APPROX-RANDOM
Jon Lee, Maxim Sviridenko, Jan Vondrák
2008 J jnl
An algorithmic framework for convex mixed integer nonlinear programs.
Discret. Optim.
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas W. Sawaya, Andreas Wächter
2008 B conf
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs.
IPCO
Anureet Saxena, Pierre Bonami, Jon Lee
2008 B conf
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility.
ISSAC
Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies
2008 J jnl
Nonlinear Matroid Optimization and Experimental Design.
SIAM J. Discret. Math.
Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn
2008 J jnl
Nonlinear Optimization over a Weighted Independence System
CoRR
Jon Lee, Shmuel Onn, Robert Weismantel
2008 J jnl
On test sets for nonlinear integer maximization.
Oper. Res. Lett.
Jon Lee, Shmuel Onn, Robert Weismantel
2007 J jnl
In situ column generation for a cutting-stock problem.
Comput. Oper. Res.
Jon Lee
2007 J jnl
Mixed integer programming.
Discret. Optim.
Jon Lee, Adam N. Letchford
2007 J jnl
Mixed-integer nonlinear programming: Some modeling and solution issues.
IBM J. Res. Dev.
Jon Lee
2007 J jnl
Nonlinear Matroid Optimization and Experimental Design.
CoRR
Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn
2007 J jnl
On a Binary-Encoded ILP Coloring Formulation.
INFORMS J. Comput.
Jon Lee, François Margot
2007 J jnl
Solving maximum-entropy sampling problems using factored masks.
Math. Program.
Samuel Burer, Jon Lee
2006 A conf
An MINLP Solution Method for a Water Network Problem.
ESA
Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth
2006 J jnl
Using AMPL for Teaching the TSP.
INFORMS Trans. Educ.
Jon Lee, John F. Raffensperger
2005 J jnl
Parsimonious binary-encoding in integer programming.
Discret. Optim.
Don Coppersmith, Jon Lee
2005 J jnl
Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.
Ann. Oper. Res.
Laszlo Ladányi, Jon Lee, Robin Lougee-Heimer
2005 J jnl
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation.
J. Comb. Optim.
Jon Lee, Janny Leung, Sven de Vries
2004 J jnl
Min-up/min-down polytopes.
Discret. Optim.
Jon Lee, Janny Leung, François Margot
2004 B conf
More on a Binary-Encoded Coloring Formulation.
IPCO
Jon Lee, François Margot
2003 J jnl
A linear integer programming bound for maximum-entropy sampling.
Math. Program.
Jon Lee, Joy Williams
2003 J jnl
Cropped Cubes.
J. Comb. Optim.
Jon Lee
2002 J jnl
All-Different Polytopes.
J. Comb. Optim.
Jon Lee
2001 A* conf
Evaluating multiple attribute items using queries.
EC
Vijay S. Iyengar, Jon Lee, Murray Campbell
2001 J jnl
Maximum-entropy remote sampling.
Discret. Appl. Math.
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
2001 J jnl
Polyhedral methods for piecewise-linear functions I: the lambda method.
Discret. Appl. Math.
Jon Lee, Dan Wilson
1999 J jnl
A Characterization of the Orientations of Ternary Matroids.
J. Comb. Theory B
Jon Lee, Matt Scobee
1999 J jnl
Orienting Matroids Representable Over Both GF(3) and GF(5).
Eur. J. Comb.
Jon Lee
1999 J jnl
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems.
Math. Program.
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
1998 J jnl
Constrained Maximum-Entropy Sampling.
Oper. Res.
Jon Lee
1998 J jnl
On the boolean-quadric packinguncapacitated facility-location polytope.
Ann. Oper. Res.
Jill Hardin, Jon Lee, Janny Leung
1997 J jnl
Classroom Note: Hoffman's Circle Untangled.
SIAM Rev.
Jon Lee
1997 J jnl
The volume of relaxed Boolean-quadric and cut polytopes.
Discret. Math.
Chun-Wa Ko, Jon Lee, Einar Steingrímsson
1996 B conf
Continuous Relaxations for Constrained Maximum-Entropy Sampling.
IPCO
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
1995 J jnl
An Exact Algorithm for Maximum Entropy Sampling.
Oper. Res.
Chun-Wa Ko, Jon Lee, Maurice Queyranne
1994 J jnl
Geometric Comparison of Combinatorial Polytopes.
Discret. Appl. Math.
Jon Lee, Walter D. Morris Jr.
1994 J jnl
Local bipartite turán graphs and graph partitioning.
Networks
Jon Lee, Jennifer Ryan
1994 J jnl
More facets from fences for linear ordering and acyclic subgraph polytopes.
Discret. Appl. Math.
Janny Leung, Jon Lee
1993 J jnl
A comparison of two edge-coloring formulations.
Oper. Res. Lett.
Jon Lee, Janny Leung
1993 J jnl
Order selection on a single machine with high set-up costs.
Ann. Oper. Res.
Brenda L. Dietrich, Jon Lee, Yew Sing Lee
1992 J jnl
Crashing a maximum-weight complementary basis.
Math. Program.
Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford
1992 J jnl
Matroid Applications and Algorithms.
INFORMS J. Comput.
Jon Lee, Jennifer Ryan
1992 J jnl
On Constrained Bottleneck Extrema.
Oper. Res.
Jon Lee
1990 J jnl
A Spectral Approach to Polyhedral Dimension.
Math. Program.
Jon Lee
1990 J jnl
Canonical equation sets for classes of concordant polytopes.
Discret. Appl. Math.
Jon Lee
1990 J jnl
Characterizations of the Dimension for Classes of Concordant Polytopes.
Math. Oper. Res.
Jon Lee
1990 J jnl
The incidence structure of subspaces with well-scaled frames.
J. Comb. Theory B
Jon Lee
1989 J jnl
Turán's Triangle Theorem and Binary Matroids.
Eur. J. Comb.
Jon Lee