Juan Pablo Vielma
Juan Pablo Vielma
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
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
2662010
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
JP Vielma, GL Nemhauser
Mathematical Programming 128 (1-2), 49-72, 2011
2272011
Mixed integer linear programming formulation techniques
JP Vielma
SIAM Review 57 (1), 3-57, 2015
1742015
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
1512008
Imposing Connectivity Constraints in Forest Planning Models
R Carvajal, M Constantino, M Goycoolea, JP Vielma, A Weintraub
Operations Research 61 (4), 824-836, 2013
882013
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
712009
Fitting Piecewise Linear Continuous Functions
A Toriello, JP Vielma
European Journal of Operational Research 219 (1), 86-95, 2010
652010
The split closure of a strictly convex body
D Dadush, SS Dey, JP Vielma
Operations Research Letters 39 (2), 121-126, 2011
562011
Nonconvex, lower semicontinuous piecewise linear optimization
JP Vielma, AB Keha, GL Nemhauser
Discrete Optimization 5 (2), 467-488, 2008
492008
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
462016
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
422015
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
Extended formulations in mixed-integer convex programming
M Lubin, E Yamangil, R Bent, JP Vielma
International Conference on Integer Programming and Combinatorial …, 2016
402016
On the Chvátal–Gomory closure of a compact convex set
D Dadush, SS Dey, JP Vielma
Mathematical Programming 145 (1-2), 327-348, 2014
382014
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
JP Vielma, GL Nemhauser
International Conference on Integer Programming and Combinatorial …, 2008
382008
Extended formulations in mixed integer conic quadratic programming
JP Vielma, I Dunning, J Huchette, M Lubin
Mathematical Programming Computation 9, 369-418, 2017
322017
Polyhedral approximation in mixed-integer convex optimization
M Lubin, E Yamangil, R Bent, JP Vielma
Mathematical Programming 172 (1-2), 139-168, 2018
312018
A constructive characterization of the split closure of a mixed integer linear program
JP Vielma
Operations Research Letters 35 (1), 29-35, 2007
312007
The Chvátal-Gomory Closure of a Strictly Convex Body
D Dadush, SS Dey, JP Vielma
Mathematics of Operations Research 36 (2), 227-239, 2011
24*2011
A strong dual for conic mixed-integer programs
DA Morán R, SS Dey, JP Vielma
SIAM Journal on Optimization 22 (3), 1136-1150, 2012
232012
The system can't perform the operation now. Try again later.
Articles 1–20