Juan Pablo Vielma
Juan Pablo Vielma
Research Scientist, Google
Adresse e-mail validée de - Page d'accueil
Citée par
Citée par
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
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
JP Vielma, GL Nemhauser
Mathematical Programming 128 (1), 49-72, 2011
Mixed integer linear programming formulation techniques
JP Vielma
SIAM Review 57 (1), 3-57, 2015
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
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
Imposing Connectivity Constraints in Forest Planning Models
R Carvajal, M Constantino, M Goycoolea, JP Vielma, A Weintraub
Operations Research 61 (4), 824-836, 2013
Fitting Piecewise Linear Continuous Functions
A Toriello, JP Vielma
European Journal of Operational Research 219 (1), 86-95, 2010
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
Extended formulations in mixed-integer convex programming
M Lubin, E Yamangil, R Bent, JP Vielma
International Conference on Integer Programming and Combinatorial …, 2016
The split closure of a strictly convex body
D Dadush, SS Dey, JP Vielma
Operations Research Letters 39 (2), 121-126, 2011
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
Polyhedral approximation in mixed-integer convex optimization
M Lubin, E Yamangil, R Bent, JP Vielma
Mathematical Programming 172 (1), 139-168, 2018
Nonconvex, lower semicontinuous piecewise linear optimization
JP Vielma, AB Keha, GL Nemhauser
Discrete Optimization 5 (2), 467-488, 2008
Extended formulations in mixed integer conic quadratic programming
JP Vielma, I Dunning, J Huchette, M Lubin
Mathematical Programming Computation 9, 369-418, 2017
Split cuts and extended formulations for mixed integer conic quadratic programming
S Modaresi, MR Kılınç, JP Vielma
Operations Research Letters 43 (1), 10-15, 2015
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
Outer approximation with conic certificates for mixed-integer convex problems
C Coey, M Lubin, JP Vielma
Mathematical Programming Computation 12 (2), 249-293, 2020
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
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
On the Chvátal–Gomory closure of a compact convex set
D Dadush, SS Dey, JP Vielma
Mathematical Programming 145 (1), 327-348, 2014
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20