 | 2009 |
|---|
| 38 |       | Jon Lee,
Shmuel Onn,
Robert Weismantel:
Nonlinear Optimization over a Weighted Independence System.
AAIM 2009: 251-264 |
| 37 | | Jon Lee,
Maxim Sviridenko,
Jan Vondrák:
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.
APPROX-RANDOM 2009: 244-257 |
| 36 | | Jon Lee:
On the Boundary of Tractability for Nonlinear Discrete Optimization.
CTW 2009: 373-383 |
| 35 | | 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 |
| 34 | | Jon Lee,
Vahab S. Mirrokni,
Viswanath Nagarajan,
Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints.
STOC 2009: 323-332 |
| 33 | | Jon Lee,
Vahab S. Mirrokni,
Viswanath Nagarajan,
Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints
CoRR abs/0902.0353: (2009) |
| 2008 |
|---|
| 32 | | Anureet Saxena,
Pierre Bonami,
Jon Lee:
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs.
IPCO 2008: 17-33 |
| 31 | | Jon Lee,
Shmuel Onn,
Robert Weismantel:
Nonlinear Optimization over a Weighted Independence System
CoRR abs/0805.0954: (2008) |
| 30 | | 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) |
| 29 | | Jon Lee,
Shmuel Onn,
Robert Weismantel:
On test sets for nonlinear integer maximization.
Oper. Res. Lett. 36(4): 439-443 (2008) |
| 28 | | 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 |
|---|
| 27 | | Jon Lee:
In situ column generation for a cutting-stock problem.
Computers & OR 34(8): 2345-2358 (2007) |
| 26 | | Jon Lee,
Adam N. Letchford:
Mixed integer programming.
Discrete Optimization 4(1): 1-2 (2007) |
| 25 | | Jon Lee:
Mixed-integer nonlinear programming: Some modeling and solution issues.
IBM Journal of Research and Development 51(3/4): 489-497 (2007) |
| 24 | | Jon Lee,
François Margot:
On a Binary-Encoded ILP Coloring Formulation.
INFORMS Journal on Computing 19(3): 406-415 (2007) |
| 23 | | Samuel Burer,
Jon Lee:
Solving maximum-entropy sampling problems using factored masks.
Math. Program. 109(2-3): 263-281 (2007) |
| 2006 |
|---|
| 22 | | 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 |
|---|
| 21 | | 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) |
| 20 | | Don Coppersmith,
Jon Lee:
Parsimonious binary-encoding in integer programming.
Discrete Optimization 2(3): 190-200 (2005) |
| 19 | | 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 |
|---|
| 18 | | Jon Lee,
François Margot:
More on a Binary-Encoded Coloring Formulation.
IPCO 2004: 271-282 |
| 17 | | Jon Lee,
Janny Leung,
François Margot:
Min-up/min-down polytopes.
Discrete Optimization 1(1): 77-85 (2004) |
| 2003 |
|---|
| 16 | | Jon Lee:
Cropped Cubes.
J. Comb. Optim. 7(2): 169-178 (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) |
