Jon Lee - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

On the Number of Solutions of the Discretizable Molecular Distance Geometry ProblemLeo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino. cocoa 2011: 322-342 [doi]

A Probing Algorithm for MINLP with Failure Prediction by SVMGiacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, François Margot, Andreas Wächter. cpaior 2011: 154-169 [doi]

2010

On the Convergence of Feasibility based Bounds TighteningPietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti. colognetwente 2010: 21-24

Feasibility-Based Bounds Tightening via Fixed PointsPietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti. cocoa 2010: 65-76 [doi]

Parametric nonlinear discrete optimization over well-described sets and matroid intersectionsYael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel. mp, 124(1-2):233-253, 2010. [doi]

On convex relaxations of quadrilinear termsSonia Cafieri, Jon Lee, Leo Liberti. jgo, 47(4):661-685, 2010. [doi]

Submodular Maximization over Multiple Matroids via Generalized Exchange PropertiesJon Lee, Maxim Sviridenko, Jan Vondrák. mor, 35(4):795-806, 2010. [doi]

Matroid matching: the power of local searchJon Lee, Maxim Sviridenko, Jan Vondrák. stoc 2010: 369-378 [doi]

Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack ConstraintsJon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. siamdm, 23(4):2053-2078, 2010. [doi]

Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulationsAnureet Saxena, Pierre Bonami, Jon Lee. mp, 124(1-2):383-411, 2010. [doi]

2009

A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexityClaudia D Ambrosio, Jon Lee, Andreas WÃ¤chter. esa 2009: 107-118 [doi]

Submodular Maximization over Multiple Matroids via Generalized Exchange PropertiesJon Lee, Maxim Sviridenko, Jan VondrÃ¡k. approx 2009: 244-257 [doi]

Approximate Nonlinear Optimization over Weighted Independence SystemsJon Lee, Shmuel Onn, Robert Weismantel. siamdm, 23(4):1667-1681, 2009. [doi]

On the Boundary of Tractability for Nonlinear Discrete OptimizationJon Lee. colognetwente 2009: 373-383 [doi]

Nonlinear Optimization over a Weighted Independence SystemJon Lee, Shmuel Onn, Robert Weismantel. AAIM 2009: 251-264 [doi]

Non-monotone submodular maximization under matroid and knapsack constraintsJon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. stoc 2009: 323-332 [doi]

Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert s NullstellensatzJesÃºs A. De Loera, Jon Lee, S. Margulies, Shmuel Onn. cpc, 18(4):551-582, 2009. [doi]

Computation in multicriteria matroid optimizationJesÃºs A. De Loera, David C. Haws, Jon Lee, Allison O Hair. jea, 14, 2009. [doi]

2008

2007

Solving maximum-entropy sampling problems using factored masksSamuel Burer, Jon Lee. mp, 109(2-3):263-281, 2007. [doi]

In situ column generation for a cutting-stock problemJon Lee. cor, 34(8):2345-2358, 2007. [doi]

On a Binary-Encoded ILP Coloring FormulationJon Lee, FranÃ§ois Margot. informs, 19(3):406-415, 2007. [doi]

Mixed integer programmingJon Lee, Adam N. Letchford. disopt, 4(1):1-2, 2007. [doi]

Mixed-integer nonlinear programming: Some modeling and solution issuesJon Lee. ibmrd, 51(3/4):489-497, 2007. [doi]

2006

An MINLP Solution Method for a Water Network ProblemCristiana Bragalli, Claudia D Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. esa 2006: 696-707 [doi]

2005

Parsimonious binary-encoding in integer programmingDon Coppersmith, Jon Lee. disopt, 2(3):190-200, 2005. [doi]

Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock ProblemLaszlo Ladanyi, Jon Lee, Robin Lougee-Heimer. anor, 139(1):243-265, 2005. [doi]

Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring FormulationJon Lee, Janny Leung, Sven de Vries. jco, 9(1):59-67, 2005. [doi]

2004

Min-up/min-down polytopesJon Lee, Janny Leung, François Margot. disopt, 1(1):77-85, 2004. [doi]

More on a Binary-Encoded Coloring FormulationJon Lee, François Margot. ipco 2004: 271-282 [doi]

2003

Cropped CubesJon Lee. jco, 7(2):169-178, 2003. [doi]

A linear integer programming bound for maximum-entropy samplingJon Lee, Joy Williams. mp, 94(2-3):247-256, 2003. [doi]

2002

All-Different PolytopesJon Lee. jco, 6(3):335-352, 2002.

2001

Maximum-entropy remote samplingKurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. DAM, 108(3):211-226, 2001.

Evaluating multiple attribute items using queriesVijay S. Iyengar, Jon Lee, Murray Campbell. sigecom 2001: 144-153 [doi]

Polyhedral methods for piecewise-linear functions I: the lambda methodJon Lee, Dan Wilson. DAM, 108(3):269-285, 2001.

1999

A Characterization of the Orientations of Ternary MatroidsJon Lee, Matt Scobee. JCT, 77(2):263-291, 1999. [doi]

Orienting Matroids Representable Over Both GF(3) and GF(5)Jon Lee. ejc, 20(8):833-838, 1999. [doi]

1997

The volume of relaxed Boolean-quadric and cut polytopesChun-Wa Ko, Jon Lee, Einar Steingrímsson. DM, 163(1-3):293-298, 1997. [doi]

1996

Continuous Relaxations for Constrained Maximum-Entropy SamplingKurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. ipco 1996: 234-248

1994

Geometric Comparison of Combinatorial PolytopesJon Lee, Walter D. Morris Jr.. DAM, 55(2):163-182, 1994. [doi]

More facets from fences for linear ordering and acyclic subgraph polytopesJanny Leung, Jon Lee. DAM, 50(2):185-200, 1994.

1992

Crashing a maximum-weight complementary basisKurt M. Anstreicher, Jon Lee, Thomas F. Rutherford. mp, 54:281-294, 1992.

Matroid Applications and AlgorithmsJon Lee, Jennifer Ryan. informs, 4(1):70-98, 1992. [doi]

1990

The incidence structure of subspaces with well-scaled framesJon Lee. JCT, 50(2):265-287, 1990. [doi]

Canonical equation sets for classes of concordant polytopesJon Lee. DAM, 28(3):207-221, 1990. [doi]

A Spectral Approach to Polyhedral DimensionJon Lee. mp, 47:441-459, 1990.