| Mixed-integer models for nonseparable piecewise-linear optimization: Unifying framework and extensions JP Vielma, S Ahmed, G Nemhauser Operations research 58 (2), 303-315, 2010 | 459 | 2010 |
| Mixed integer linear programming formulation techniques JP Vielma SIAM Review 57 (1), 3-57, 2015 | 439 | 2015 |
| Modeling disjunctive constraints with a logarithmic number of binary variables and constraints JP Vielma, GL Nemhauser Mathematical Programming 128, 49-72, 2011 | 384 | 2011 |
| Strong mixed-integer programming formulations for trained neural networks R Anderson, J Huchette, W Ma, C Tjandraatmadja, JP Vielma Mathematical Programming 183, 3-39, 2020 | 328 | 2020 |
| JuMP 1.0: Recent improvements to a modeling language for mathematical optimization M Lubin, O Dowson, JD Garcia, J Huchette, B Legat, JP Vielma Mathematical Programming Computation 15 (3), 581-589, 2023 | 294 | 2023 |
| A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs JP Vielma, S Ahmed, GL Nemhauser INFORMS Journal on Computing 20 (3), 438-450, 2008 | 191 | 2008 |
| Imposing Connectivity Constraints in Forest Planning Models R Carvajal, M Constantino, M Goycoolea, JP Vielma, A Weintraub Operations Research 61 (4), 824-836, 2013 | 173 | 2013 |
| Fitting Piecewise Linear Continuous Functions A Toriello, JP Vielma European Journal of Operational Research 219 (1), 86-95, 2010 | 135 | 2010 |
| The convex relaxation barrier, revisited: Tightened single-neuron relaxations for neural network verification C Tjandraatmadja, R Anderson, J Huchette, W Ma, KK Patel, JP Vielma Advances in Neural Information Processing Systems 33, 21675-21686, 2020 | 98 | 2020 |
| Evaluating approaches for solving the area restriction model in harvest scheduling M Goycoolea, A Murray, JP Vielma, A Weintraub Forest Science 55 (2), 149-165, 2009 | 93 | 2009 |
| Outer approximation with conic certificates for mixed-integer convex problems C Coey, M Lubin, JP Vielma Mathematical Programming Computation 12 (2), 249-293, 2020 | 81 | 2020 |
| Polyhedral approximation in mixed-integer convex optimization M Lubin, E Yamangil, R Bent, JP Vielma Mathematical Programming 172, 139-168, 2018 | 81 | 2018 |
| Nonconvex piecewise linear functions: Advanced formulations and simple modeling tools J Huchette, JP Vielma Operations Research 71 (5), 1835-1856, 2023 | 80 | 2023 |
| Extended formulations in mixed-integer convex programming M Lubin, E Yamangil, R Bent, JP Vielma Integer Programming and Combinatorial Optimization: 18th International …, 2016 | 75 | 2016 |
| Building representative matched samples with multi-valued treatments in large observational studies M Bennett, JP Vielma, JR Zubizarreta Journal of computational and graphical statistics 29 (4), 744-757, 2020 | 72* | 2020 |
| Intersection cuts for nonlinear integer programming: Convexification techniques for structured sets S Modaresi, MR Kılınç, JP Vielma Mathematical Programming 155 (1), 575-611, 2016 | 67 | 2016 |
| The split closure of a strictly convex body D Dadush, SS Dey, JP Vielma Operations Research Letters 39 (2), 121-126, 2011 | 60 | 2011 |
| Solving natural conic formulations with Hypatia. jl C Coey, L Kapelevich, JP Vielma INFORMS Journal on Computing 34 (5), 2686-2699, 2022 | 58* | 2022 |
| Nonconvex, lower semicontinuous piecewise linear optimization JP Vielma, AB Keha, GL Nemhauser Discrete Optimization 5 (2), 467-488, 2008 | 56 | 2008 |
| Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems JP Vielma, AT Murray, DM Ryan, A Weintraub European Journal of Operational Research 176 (2), 1246-1264, 2007 | 55 | 2007 |
Joey HuchetteGoogle ResearchVerified email at google.com
