![]() | ![]() |
| 2011 | ||
|---|---|---|
| 57 | Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino: On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem. COCOA 2011: 322-342 | |
| 56 | Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, François Margot, Andreas Wächter: A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR 2011: 154-169 | |
| 55 | Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies: Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz. J. Symb. Comput. 46(11): 1260-1283 (2011) | |
| 54 | Anureet Saxena, Pierre Bonami, Jon Lee: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130(2): 359-413 (2011) | |
| 2010 | ||
| 53 | Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti: Feasibility-Based Bounds Tightening via Fixed Points. COCOA (1) 2010: 65-76 | |
| 52 | Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti: On the Convergence of Feasibility based Bounds Tightening. CTW 2010: 21-24 | |
| 51 | Jon Lee, Maxim Sviridenko, Jan Vondrák: Matroid matching: the power of local search. STOC 2010: 369-378 | |
| 50 | Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel: The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions CoRR abs/1006.0773: (2010) | |
| 49 | Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino: On the number of solutions of the discretizable molecular distance geometry problem CoRR abs/1010.1834: (2010) | |
| 48 | Sonia Cafieri, Jon Lee, Leo Liberti: On convex relaxations of quadrilinear terms. J. Global Optimization 47(4): 661-685 (2010) | |
| 47 | Jon Lee, Maxim Sviridenko, Jan Vondrák: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. Math. Oper. Res. 35(4): 795-806 (2010) | |
| 46 | Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel: Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124(1-2): 233-253 (2010) | |
| 45 | Anureet Saxena, Pierre Bonami, Jon Lee: Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124(1-2): 383-411 (2010) | |
| 44 | Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discrete Math. 23(4): 2053-2078 (2010) | |
| 2009 | ||
| 43 | Jon Lee, Shmuel Onn, Robert Weismantel: Nonlinear Optimization over a Weighted Independence System. AAIM 2009: 251-264 | |
| 42 | Jon Lee, Maxim Sviridenko, Jan Vondrák: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. APPROX-RANDOM 2009: 244-257 | |
| 41 | Jon Lee: On the Boundary of Tractability for Nonlinear Discrete Optimization. CTW 2009: 373-383 | |
| 40 | Claudia D'Ambrosio, Jon Lee, Andreas Wächter: A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. ESA 2009: 107-118 | |
| 39 | Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints. STOC 2009: 323-332 | |
| 38 | Jesús A. De Loera, David C. Haws, Jon Lee, Allison O'Hair: Computation in multicriteria matroid optimization. ACM Journal of Experimental Algorithmics 14: (2009) | |
| 37 | Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko: Non-monotone submodular maximization under matroid and knapsack constraints CoRR abs/0902.0353: (2009) | |
| 36 | Jesús A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn: Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. Combinatorics, Probability & Computing 18(4): 551-582 (2009) | |
| 35 | Jon Lee, Shmuel Onn, Robert Weismantel: Approximate Nonlinear Optimization over Weighted Independence Systems. SIAM J. Discrete Math. 23(4): 1667-1681 (2009) | |
| 2008 | ||
| 34 | Anureet Saxena, Pierre Bonami, Jon Lee: Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. IPCO 2008: 17-33 | |
| 33 | Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies: Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility. ISSAC 2008: 197-206 | |
| 32 | Jon Lee, Shmuel Onn, Robert Weismantel: Nonlinear Optimization over a Weighted Independence System CoRR abs/0805.0954: (2008) | |
| 31 | 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: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization 5(2): 186-204 (2008) | |
| 30 | Jon Lee, Shmuel Onn, Robert Weismantel: On test sets for nonlinear integer maximization. Oper. Res. Lett. 36(4): 439-443 (2008) | |
| 29 | Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn: Nonlinear Matroid Optimization and Experimental Design. SIAM J. Discrete Math. 22(3): 901-919 (2008) | |
| 2007 | ||
| 28 | Jon Lee: In situ column generation for a cutting-stock problem. Computers & OR 34(8): 2345-2358 (2007) | |
| 27 | Jon Lee, Adam N. Letchford: Mixed integer programming. Discrete Optimization 4(1): 1-2 (2007) | |
| 26 | Jon Lee: Mixed-integer nonlinear programming: Some modeling and solution issues. IBM Journal of Research and Development 51(3/4): 489-497 (2007) | |
| 25 | Jon Lee, François Margot: On a Binary-Encoded ILP Coloring Formulation. INFORMS Journal on Computing 19(3): 406-415 (2007) | |
| 24 | Samuel Burer, Jon Lee: Solving maximum-entropy sampling problems using factored masks. Math. Program. 109(2-3): 263-281 (2007) | |
| 2006 | ||
| 23 | Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth: An MINLP Solution Method for a Water Network Problem. ESA 2006: 696-707 | |
| 2005 | ||
| 22 | Laszlo Ladányi, Jon Lee, Robin Lougee-Heimer: Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem. Annals OR 139(1): 243-265 (2005) | |
| 21 | Don Coppersmith, Jon Lee: Parsimonious binary-encoding in integer programming. Discrete Optimization 2(3): 190-200 (2005) | |
| 20 | Jon Lee, Janny Leung, Sven de Vries: Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. J. Comb. Optim. 9(1): 59-67 (2005) | |
| 2004 | ||
| 19 | Jon Lee, François Margot: More on a Binary-Encoded Coloring Formulation. IPCO 2004: 271-282 | |
| 18 | Jon Lee, Janny Leung, François Margot: Min-up/min-down polytopes. Discrete Optimization 1(1): 77-85 (2004) | |
| 2003 | ||
| 17 | Jon Lee: Cropped Cubes. J. Comb. Optim. 7(2): 169-178 (2003) | |
| 16 | Jon Lee, Joy Williams: A linear integer programming bound for maximum-entropy sampling. Math. Program. 94(2-3): 247-256 (2003) | |
| 2002 | ||
| 15 | Jon Lee: All-Different Polytopes. J. Comb. Optim. 6(3): 335-352 (2002) | |
| 2001 | ||
| 14 | Vijay S. Iyengar, Jon Lee, Murray Campbell: Evaluating multiple attribute items using queries. ACM Conference on Electronic Commerce 2001: 144-153 | |
| 13 | Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams: Maximum-entropy remote sampling. Discrete Applied Mathematics 108(3): 211-226 (2001) | |
| 12 | Jon Lee, Dan Wilson: Polyhedral methods for piecewise-linear functions I: the lambda method. Discrete Applied Mathematics 108(3): 269-285 (2001) | |
| 1999 | ||
| 11 | Jon Lee: Orienting Matroids Representable Over Both GF(3) and GF(5). Eur. J. Comb. 20(8): 833-838 (1999) | |
| 10 | Jon Lee, Matt Scobee: A Characterization of the Orientations of Ternary Matroids. J. Comb. Theory, Ser. B 77(2): 263-291 (1999) | |
| 1997 | ||
| 9 | Chun-Wa Ko, Jon Lee, Einar Steingrímsson: The volume of relaxed Boolean-quadric and cut polytopes. Discrete Mathematics 163(1-3): 293-298 (1997) | |
| 1996 | ||
| 8 | Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams: Continuous Relaxations for Constrained Maximum-Entropy Sampling. IPCO 1996: 234-248 | |
| 1994 | ||
| 7 | Janny Leung, Jon Lee: More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Applied Mathematics 50(2): 185-200 (1994) | |
| 6 | Jon Lee, Walter D. Morris Jr.: Geometric Comparison of Combinatorial Polytopes. Discrete Applied Mathematics 55(2): 163-182 (1994) | |
| 1992 | ||
| 5 | Jon Lee, Jennifer Ryan: Matroid Applications and Algorithms. INFORMS Journal on Computing 4(1): 70-98 (1992) | |
| 4 | Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford: Crashing a maximum-weight complementary basis. Math. Program. 54: 281-294 (1992) | |
| 1990 | ||
| 3 | Jon Lee: Canonical equation sets for classes of concordant polytopes. Discrete Applied Mathematics 28(3): 207-221 (1990) | |
| 2 | Jon Lee: The incidence structure of subspaces with well-scaled frames. J. Comb. Theory, Ser. B 50(2): 265-287 (1990) | |
| 1 | Jon Lee: A Spectral Approach to Polyhedral Dimension. Math. Program. 47: 441-459 (1990) | |
Colors in the list of coauthors
Last update Sun Feb 12 22:50:56 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page