Jon Lee

发表

Classroom Note: Hoffman's Circle Untangled

Jon Lee, Jon Lee, 1997, SIAM Rev..

More on a Binary-Encoded Coloring Formulation

François Margot, Jon Lee, 2004, IPCO.

The quadratic Graver cone, quadratic integer minimization, and extensions

Jon Lee, Robert Weismantel, Shmuel Onn, 2010, Math. Program..

A First Course in Combinatorial Optimization: References

Jon Lee, 2004 .

Techniques for Submodular Maximization

Jon Lee, Jon Lee, 2013 .

On branching rules for convex mixed-integer nonlinear optimization

Sven Leyffer, Andreas Wächter, Jon Lee, 2013, JEAL.

Branching and bounds tighteningtechniques for non-convex MINLP

Leo Liberti, Pietro Belotti, François Margot, 2009, Optim. Methods Softw..

Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations

Han Yu, Jon Lee, Emily Speakman, 2017, CPAIOR.

Another pedagogy for pure-integer Gomory

Qi He, Jon Lee, Jon Lee, 2015, RAIRO Oper. Res..

Canonical equation sets for classes of concordant polytopes

Jon Lee, 1990, Discret. Appl. Math..

On the number of realizations of certain Henneberg graphs arising in protein conformation

Leo Liberti, Antonio Mucherino, Carlile Lavor, 2014, Discret. Appl. Math..

Optimal rank-sparsity decomposition

Jon Lee, Bai Zou, Jon Lee, 2014, J. Glob. Optim..

Matroid Matching: The Power of Local Search

Jan Vondrák, Maxim Sviridenko, Jon Lee, 2013, SIAM J. Comput..

Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems

Jon Lee, Kurt M. Anstreicher, Marcia Fampa, 1999, Math. Program..

Taking Your Relationship to the Next Level: Creating and Solidifying Your Connection to the C-suite

Jon Lee, 2012 .

Integer programming and combinatorial optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014, proceedings

Jens Vygen, Jon Lee, 2014 .

Highly sensitive harsh-environment sensor based on innovative long-period gratings

Bo Wang, Shizhuo Yin, Karl Reichard, 2004, SPIE Optics East.

Evaluating multiple attribute items using queries

Murray Campbell, Jon Lee, Vijay S. Iyengar, 2001, EC '01.

On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem pdf

Leo Liberti, Antonio Mucherino, Carlile Lavor, 2011, COCOA.

Mixed-integer nonlinear programming: Some modeling and solution issues

Jon Lee, Jon Lee, 2007, IBM J. Res. Dev..

Mixed integer programming

Adam N. Letchford, Jon Lee, 2007, Discret. Optim..

Demonstrating the benefits of source-mask optimization and enabling technologies through experiment and simulations

Kafai Lai, Scott Halle, Aasutosh Dave, 2010, Advanced Lithography.

A spectral approach to polyhedral dimension

Jon Lee, Jon Lee, 1990, Math. Program..

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

Jon Lee, Pierre Bonami, Anureet Saxena, 2011, Math. Program..

Turán's Triangle Theorem and Binary Matroids

Jon Lee, Jon Lee, 1989, Eur. J. Comb..

In situ column generation for a cutting-stock problem

Jon Lee, Jon Lee, 2007, Comput. Oper. Res..

Low-Rank/Sparse-Inverse Decomposition via Woodbury

Jon Lee, Victor K. Fuentes, 2016, OR.

Correction to: Combinatorial Optimization

Giovanni Rinaldi, Jon Lee, A. Ridha Mahjoub, 2018 .

A First Course in Combinatorial Optimization: Preface

Jon Lee, 2004 .

Extended Formulations for Independence Polytopes of Regular Matroids

Volker Kaibel, Matthias Walter, Jon Lee, 2015, Graphs Comb..

Supercontinuum generation in single crystal sapphire fibers

Stuart Yin, Christina Brantley, Claire Luo, 2007, SPIE Optical Engineering + Applications.

On an SDP relaxation for kissing number

Leo Liberti, Jon Lee, Jon Lee, 2020, Optim. Lett..

An overview of exact algorithms for the Euclidean Steiner tree problem in n-space

Nelson Maculan, Jon Lee, Marcia Fampa, 2016, Int. Trans. Oper. Res..

High temperature sensing using higher-order-mode rejected sapphire-crystal fiber gratings

Stuart Yin, Claire Luo, Jae Hun Kim, 2007, SPIE Optical Engineering + Applications.

A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space

Jon Lee, Marcia Fampa, Wendel Melo, 2016, Comput. Optim. Appl..

On Sparse Reflexive Generalized Inverses pdf

Jon Lee, Marcia Fampa, 2018, ArXiv.

Volume computation for sparse Boolean quadric relaxations

Jon Lee, Daphne Skipper, 2020, Discret. Appl. Math..

Computing with an algebraic-perturbation variant of Barvinok's algorithm

Jon Lee, Daphne Skipper, 2018, Discret. Appl. Math..

On convex relaxations of quadrilinear terms

Sonia Cafieri, Leo Liberti, Jon Lee, 2010, J. Glob. Optim..

A comparison of two edge-coloring formulations

Jon Lee, Janny Leung, Jon Lee, 1993, Oper. Res. Lett..

iGo Green: A Life Cycle Assessment of Apple's iPhone

Christopher Lee, Jon Lee, Angela Zhou, 2015 .

Nonlinear Optimization over a Weighted Independence System

Jon Lee, Robert Weismantel, Shmuel Onn, 2009, AAIM.

Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations

Jon Lee, Emily Speakman, Daphne Skipper, 2018, Math. Program..

On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space

Claudia D'Ambrosio, Jon Lee, Stefan Vigerske, 2015, SEA.

A Probing Algorithm for MINLP with Failure Prediction by SVM

Pietro Belotti, Giacomo Nannicini, Jeff T. Linderoth, 2011, CPAIOR.

On Sparse Reflexive Generalized Inverses

Jon Lee, Marcia Fampa, Jon Lee, 2018, Oper. Res. Lett..

A Characterization of the Orientations of Ternary Matroids

Jon Lee, Matt Scobee, Jon Lee, 1999, J. Comb. Theory, Ser. B.

Parametric nonlinear discrete optimization over well-described sets and matroid intersections

Jon Lee, Robert Weismantel, Shmuel Onn, 2010, Math. Program..

Computation in multicriteria matroid optimization

Jesús A. De Loera, David Haws, Jon Lee, 2009, JEAL.

On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs

Jon Lee, Claudia D’Ambrosio, Stefan Vigerske, 2020, Optim. Lett..

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz

Jesús A. De Loera, Jon Lee, Susan Margulies, 2011, J. Symb. Comput..

Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations

Jon Lee, Pierre Bonami, Anureet Saxena, 2010, Math. Program..

Max-Cut Under Graph Constraints pdf

Xiangkun Shen, Viswanath Nagarajan, Jon Lee, 2015, IPCO.

Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs

Jon Lee, Pierre Bonami, Anureet Saxena, 2008, IPCO.

An algebraic-perturbation variant of Barvinok's algorithm

Jon Lee, Daphne Skipper, 2015, Electron. Notes Discret. Math..

On the boolean-quadric packinguncapacitated facility-location polytope

Jon Lee, Janny Leung, Jill Hardin, 1998, Ann. Oper. Res..

A matroid view of key theorems for edge-swapping algorithms

Leo Liberti, Jon Lee, 2012, Math. Methods Oper. Res..

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, 2014, SIAM J. Optim..

Cropped Cubes

Jon Lee, 2003, J. Comb. Optim..

An Exact Algorithm for Maximum Entropy Sampling

Maurice Queyranne, Jon Lee, Chun-Wa Ko, 1995, Oper. Res..

Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem

Jon Lee, Robin Lougee, Laszlo Ladányi, 2005, Ann. Oper. Res..

Matroid matching: the power of local search

Jan Vondrák, Maxim Sviridenko, Jon Lee, 2010, STOC '10.

Crashing a maximum-weight complementary basis

Jon Lee, Kurt M. Anstreicher, Thomas F. Rutherford, 1992, Math. Program..

Ultrasensitive fiber optic sensors and their applications

Shizhuo Yin, Karl Reichard, Qing Wang, 2005, SPIE BiOS.

Design and implementation of an all-fiber ultrafast widely tunable wavelength filter

Bo Wang, Shizhuo Yin, Qing Wang, 2005, SPIE/COS Photonics Asia.

Another pedagogy for mixed-integer Gomory

Jon Lee, Angelika Wiegele, 2017, EURO J. Comput. Optim..

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

Vahab S. Mirrokni, Maxim Sviridenko, Viswanath Nagarajan, 2009, SIAM J. Discret. Math..

Weak orientability of matroids and polynomial equations

Jesús A. De Loera, Jon Lee, J. Miller, 2013, Eur. J. Comb..

More facets from fences for linear ordering and acyclic subgraph polytopes

Jon Lee, Janny Leung, Jon Lee, 1994, Discret. Appl. Math..

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility

Jesús A. De Loera, Jon Lee, Susan Margulies, 2008, ISSAC '08.

Efficient high-precision dense matrix algebra on parallel architectures for nonlinear discrete optimization

Susan S. Margulies, Jon Lee, John A. Gunnels, 2008 .

On Constrained Bottleneck Extrema

Jon Lee, 1992, Oper. Res..

The volume of relaxed Boolean-quadric and cut polytopes

Jon Lee, Einar Steingrímsson, Chun-Wa Ko, 1997, Discret. Math..

Using AMPL for Teaching the TSP

John F. Raffensperger, Jon Lee, Jon Lee, 2006, INFORMS Trans. Educ..

Polyhedral methods for piecewise-linear functions I: the lambda method

Jon Lee, Dan Wilson, Jon Lee, 2001, Discret. Appl. Math..

Nonlinear Integer Programming

Raymond Hemmecke, Jon Lee, Matthias Köppe, 2009, 50 Years of Integer Programming.

On the Convergence of Feasibility based Bounds Tightening

Sonia Cafieri, Leo Liberti, Pietro Belotti, 2010, CTW.

Matroid Applications and Algorithms

Jennifer Ryan, Jon Lee, 1992, INFORMS J. Comput..

Optimizing the Design of Water Distribution Networks Using Mathematical Optimization

Paolo Toth, Andrea Lodi, Cristiana Bragalli, 2015 .

Discretization orders for distance geometry problems

Leo Liberti, Maxim Sviridenko, Antonio Mucherino, 2012, Optim. Lett..

A First Course in Combinatorial Optimization: Frontmatter

Jon Lee, Jon Lee, 2004 .

On a Binary-Encoded ILP Coloring Formulation

François Margot, Jon Lee, 2007, INFORMS J. Comput..

All-Different Polytopes

Jon Lee, 2002, J. Comb. Optim..

Geometric Comparison of Combinatorial Polytopes

Jon Lee, Walter D. Morris, Jon Lee, 1994, Discret. Appl. Math..

IBM Research Report On Convex Relaxations of Quadrilinear Terms

Sonia Cafieri, Jon Lee, 2009 .

Maximum-entropy remote sampling

Jon Lee, Kurt M. Anstreicher, Marcia Fampa, 2001, Discret. Appl. Math..

A First Course in Combinatorial Optimization: Appendix: Notation and Terminology

Jon Lee, 2004 .

A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity

Andreas Wächter, Claudia D'Ambrosio, Jon Lee, 2009, ESA.

Diving for Sparse Partially-Reflexive Generalized Inverses

Jon Lee, Marcia Fampa, Victor K. Fuentes, 2019, WCGO.

Middle-IR supercontinuum generations and applications

Paul B. Ruffin, Eugene Edwards, Stuart Yin, 2008, Organic Photonics + Electronics.

Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

Jan Vondrák, Maxim Sviridenko, Jon Lee, 2009, Math. Oper. Res..

Design of a Test Facility and Micro-Channel Heat Exchanger Prototype for High Power Electronic Components

Jon Lee, Ryan McGlen, Cosimo Buffone, 2005 .

Order selection on a single machine with high set-up costs

Jon Lee, Brenda L. Dietrich, Yew Sing Lee, 1993, Ann. Oper. Res..

Approximate Nonlinear Optimization over Weighted Independence Systems

Jon Lee, Robert Weismantel, Shmuel Onn, 2009, SIAM J. Discret. Math..

More Virtuous Smoothing

Jon Lee, Luze Xu, Daphne Skipper, 2019, SIAM J. Optim..

On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation

Jon Lee, Emily Speakman, 2018, J. Glob. Optim..

Intractability of approximate multi-dimensional nonlinear optimization on independence systems pdf

Jon Lee, Robert Weismantel, Shmuel Onn, 2010, ArXiv.

Sparse pseudoinverses via LP and SDP relaxations of Moore-Penrose

Jon Lee, Marcia Fampa, Victor K. Fuentes, 2016, 1606.06969.

Approximating Max-Cut under Graph-MSO Constraints

Martin Koutecký, Xiangkun Shen, Viswanath Nagarajan, 2018, Oper. Res. Lett..

Virtuous smoothing for global optimization

Jon Lee, Daphne Skipper, 2017, J. Glob. Optim..

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz

Jesús A. De Loera, Jon Lee, Shmuel Onn, 2009, Combinatorics, Probability and Computing.

Min-up/min-down polytopes

François Margot, Jon Lee, Janny Leung, 2004, Discret. Optim..

Non-monotone submodular maximization under matroid and knapsack constraints

Vahab S. Mirrokni, Maxim Sviridenko, Viswanath Nagarajan, 2009, STOC '09.

Parsimonious binary-encoding in integer programming

Don Coppersmith, Jon Lee, 2005, Discret. Optim..

Approximating graph-constrained max-cut

Xiangkun Shen, Viswanath Nagarajan, Jon Lee, 2018, Math. Program..

Trends in Optimization

Rekha R. Thomas, Jon Lee, Serkan Hosten, 2004 .

On test sets for nonlinear integer maximization

Jon Lee, Robert Weismantel, Shmuel Onn, 2008, Oper. Res. Lett..

Continuous Relaxations for Constrained Maximum-Entropy Sampling

Jon Lee, Kurt M. Anstreicher, Marcia Fampa, 1996, IPCO.

Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers

Siqian Shen, Jon Lee, Andrew Orso, 2015, SEA.

IBM Research Report Parsimonious Binary-Encoding In Integer Programming

Don Coppersmith, Jon Lee, D. Coppersmith, 2003 .

Feasibility-Based Bounds Tightening via Fixed Points

Sonia Cafieri, Leo Liberti, Pietro Belotti, 2010, COCOA.

An algorithmic framework for convex mixed integer nonlinear programs

Gérard Cornuéjols, Andrea Lodi, Ignacio E. Grossmann, 2008, Discret. Optim..

Nonlinear Matroid Optimization and Experimental Design pdf

Eva Riccomagno, Henry P. Wynn, Jon Lee, 2007, SIAM J. Discret. Math..

Upper Bounds for the Binary Cubic Knapsack Problem

Jon Lee, Marcia Fampa, Daniela Cristina Lubke, 2017 .

Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization

John A. Gunnels, Jon Lee, Susan Margulies, 2010, Math. Program. Comput..

IBM Research Report MINLP Strengthening for Separable Convex Quadratic Transportation-Cost UFL

Oktay Günlük, Jon Lee, Robert Weismantel, 2007 .

On global optimization with indefinite quadratics

Jon Lee, Marcia Fampa, Wendel Melo, 2017, EURO J. Comput. Optim..

Mixed Integer Nonlinear Programming

Sven Leyffer, Jon Lee, S. Leyffer, 2011 .

Quantifying Double McCormick

Jon Lee, Emily Speakman, 2017, Math. Oper. Res..

Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation

Sven de Vries, Jon Lee, Janny Leung, 2005, J. Comb. Optim..

Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization

Maks Ovsjanikov, Leo Liberti, Jon Lee, 2019 .

Orienting Matroids Representable Over Both GF(3) and GF(5)

Jon Lee, Jon Lee, 1997, Eur. J. Comb..

Solving maximum-entropy sampling problems using factored masks

Jon Lee, Samuel Burer, S. Burer, 2007, Math. Program..

Generalized maximum-entropy sampling

Jon Lee, Joy Lind, Jon Lee, 2020, INFOR Inf. Syst. Oper. Res..

The incidence structure of subspaces with well-scaled frames

Jon Lee, Jon Lee, 1990, J. Comb. Theory, Ser. B.

Convexification of bilinear forms through non-symmetric lifting

Jon Lee, Marcia Fampa, 2021, J. Glob. Optim..

Mixing convex-optimization bounds for maximum-entropy sampling

Jon Lee, Marcia Fampa, Zhongzhu Chen, 2020, Math. Program..

Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search

Jon Lee, Luze Xu, Marcia Fampa, 2019, SIAM J. Optim..

Experimental analysis of local searches for sparse reflexive generalized inverses

Jon Lee, Luze Xu, Marcia Fampa, 2020, Journal of Global Optimization.

Polynomial upper bounds on the number of differing columns of $\Delta$-modular integer programs

Jon Lee, Joseph Paat, Ingo Stallknecht, 2021 .

Technical Note—Masking Anstreicher’s linx Bound for Improved Entropy Bounds

Jon Lee, Marcia Fampa, Zhongzhu Chen, 2021, Operations Research.

On the composition of convex envelopes for quadrilinear terms

Sonia Cafieri, Leo Liberti, Pietro Belotti, 2013 .

A Polytope for a Product of Real Linear Functions in 0/1 Variables

Oktay Günlük, Jon Lee, Janny M. Y. Leung, 2012 .

Comparison of convex relaxations of quadrilinear terms

Sonia Cafieri, Leo Liberti, Jon Lee, 2009 .

Experimental validation of volume-based comparison for double-McCormick relaxations

Jon Lee, Emily Speakman, Han Yu, 2016 .