Standout Papers

An algorithmic framework for convex mixed integer nonlinear programs 2007 2026 2013 2019 541
  1. An algorithmic framework for convex mixed integer nonlinear programs (2007)
    Pierre Bonami, Lorenz T. Biegler et al. Discrete Optimization
  2. Branching and bounds tighteningtechniques for non-convex MINLP (2009)
    Pietro Belotti, Jon Lee et al. Optimization methods & software
  3. Mixed Integer Nonlinear Programming (2011)
    Jon Lee, Sven Leyffer CERN Document Server (European Organization for Nuclear Research)

Immediate Impact

2 by Nobel laureates 2 from Science/Nature 63 standout
Sub-graph 1 of 23

Citing Papers

Water electrolyzer operation scheduling for green hydrogen production: A review
2024 Standout
Discovering faster matrix multiplication algorithms with reinforcement learning
2022 StandoutNatureNobel
2 intermediate papers

Works of Jon Lee being referenced

Branching and bounds tighteningtechniques for non-convex MINLP
2009 Standout
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility
2008

Author Peers

Author Last Decade Papers Cites
Jon Lee 875 641 338 736 675 159 3.2k
Robert J. Vanderbei 1280 1276 533 599 992 141 5.7k
Leo Liberti 826 633 151 316 525 142 2.5k
Sven Leyffer 1477 1626 344 718 1354 83 3.9k
Kazuo Murota 1518 568 303 287 360 199 3.6k
Hoàng Tụy 1129 1167 222 459 608 83 2.4k
Brigitte Jaumard 939 591 95 641 513 225 3.3k
E. M. L. Beale 1014 842 286 257 880 62 3.8k
J. B. Rosen 1262 1301 379 199 666 78 3.1k
Michael C. Ferris 2215 1930 537 1020 974 152 6.3k
R. J. Duffin 1382 740 429 332 508 123 4.4k

All Works

Loading papers...

Rankless by CCL
2026