Följ
Jon Lee
Jon Lee
G. Lawton and Louise G. Johnson Professor of Engineering, University of Michigan
Verifierad e-postadress på umich.edu - Startsida
Titel
Citeras av
Citeras av
År
An algorithmic framework for convex mixed integer nonlinear programs
P Bonami, LT Biegler, AR Conn, G Cornuéjols, IE Grossmann, CD Laird, ...
Discrete Optimization 5 (2), 186-204, 2008
11602008
Branching and bounds tightening techniques for non-convex MINLP
P Belotti, J Lee, L Liberti, F Margot, A Waechter
Optimization Methods & Software 24 (4-5), 597-634, 2009
8312009
Mixed Integer Nonlinear Programming. The IMA Volumes in Mathematics and its Applications, vol. 154
J Lee, S Leyffer
Springer, New York, 2012
562*2012
An exact algorithm for maximum entropy sampling
CW Ko, J Lee, M Queyranne
Operations Research 43 (4), 684-691, 1995
4481995
Non-monotone submodular maximization under matroid and knapsack constraints
J Lee, VS Mirrokni, V Nagarajan, M Sviridenko
Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing …, 2009
3182009
On the optimal design of water distribution networks: a practical MINLP approach
C Bragalli, C D’Ambrosio, J Lee, A Lodi, P Toth
Optimization and Engineering, 1-28, 2011
2682011
BONMIN user’s manual
P Bonami, J Lee
Retrieved November 4, 2008, 2007
2362007
Nonlinear integer programming
R Hemmecke, M Köppe, J Lee, R Weismantel
50 Years of Integer Programming 1958-2008, 561-618, 2010
2352010
A First Course in Combinatorial Optimization
J Lee
Cambridge University Press, 2004
1932004
Maximizing nonmonotone submodular functions under matroid or knapsack constraints
J Lee, VS Mirrokni, V Nagarajan, M Sviridenko
SIAM Journal on Discrete Mathematics 23 (4), 2053-2078, 2010
1922010
Submodular maximization over multiple matroids via generalized exchange properties
J Lee, M Sviridenko, J Vondrák
Mathematics of Operations Research 35 (4), 795-806, 2010
1792010
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations
A Saxena, P Bonami, J Lee
Mathematical Programming 124 (1-2), 383-411, 2010
1372010
Min-up/min-down polytopes
J Lee, J Leung, F Margot
Discrete Optimization 1 (1), 77-85, 2004
1352004
Convex relaxations of non-convex mixed integer quadratically constrained programs: Projected formulations
A Saxena, P Bonami, J Lee
Mathematical programming 130 (2), 359-413, 2011
1232011
Water network design by MINLP
C Bragalli, C D’Ambrosio, J Lee, A Lodi, P Toth
Rep. No. RC24495, IBM Research, Yorktown Heights, NY, 2008
962008
Constrained maximum-entropy sampling
J Lee
Operations Research 46 (5), 655-664, 1998
931998
Polyhedral methods for piecewise-linear functions I: the lambda method
J Lee, D Wilson
Discrete Applied Mathematics 108 (3), 269-285, 2001
922001
Discretization orders for distance geometry problems
C Lavor, J Lee, A Lee-St John, L Liberti, A Mucherino, M Sviridenko
Optimization Letters 6 (4), 783-796, 2012
902012
On branching rules for convex mixed-integer nonlinear optimization
P Bonami, J Lee, S Leyffer, A Wächter
Journal of Experimental Algorithmics (JEA) 18, 2.6, 2013
77*2013
Feasibility-based bounds tightening via fixed points
P Belotti, S Cafieri, J Lee, L Liberti
International Conference on Combinatorial Optimization and Applications, 65-76, 2010
76*2010
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20