Juan Pablo Vielma
Juan Pablo Vielma
Research Scientist, Google
Dirección de correo verificada de google.com - Página principal
Título
Citado por
Citado por
Año
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
3022010
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
JP Vielma, GL Nemhauser
Mathematical Programming 128 (1), 49-72, 2011
2542011
Mixed integer linear programming formulation techniques
JP Vielma
SIAM Review 57 (1), 3-57, 2015
2102015
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
1682008
Imposing Connectivity Constraints in Forest Planning Models
R Carvajal, M Constantino, M Goycoolea, JP Vielma, A Weintraub
Operations Research 61 (4), 824-836, 2013
1072013
Fitting Piecewise Linear Continuous Functions
A Toriello, JP Vielma
European Journal of Operational Research 219 (1), 86-95, 2010
852010
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
772009
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
66*2020
The split closure of a strictly convex body
D Dadush, SS Dey, JP Vielma
Operations Research Letters 39 (2), 121-126, 2011
582011
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
532016
Nonconvex, lower semicontinuous piecewise linear optimization
JP Vielma, AB Keha, GL Nemhauser
Discrete Optimization 5 (2), 467-488, 2008
492008
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
482015
Extended formulations in mixed-integer convex programming
M Lubin, E Yamangil, R Bent, JP Vielma
International Conference on Integer Programming and Combinatorial …, 2016
442016
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
422007
On the Chvátal–Gomory closure of a compact convex set
D Dadush, SS Dey, JP Vielma
Mathematical Programming 145 (1), 327-348, 2014
392014
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
JP Vielma, GL Nemhauser
International Conference on Integer Programming and Combinatorial …, 2008
372008
Polyhedral approximation in mixed-integer convex optimization
M Lubin, E Yamangil, R Bent, JP Vielma
Mathematical Programming 172 (1), 139-168, 2018
362018
Extended formulations in mixed integer conic quadratic programming
JP Vielma, I Dunning, J Huchette, M Lubin
Mathematical Programming Computation 9, 369-418, 2017
352017
A constructive characterization of the split closure of a mixed integer linear program
JP Vielma
Operations Research Letters 35 (1), 29-35, 2007
312007
Incremental and encoding formulations for mixed integer programming
S Yıldız, JP Vielma
Operations Research Letters 41 (6), 654-658, 2013
252013
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20