Juan Pablo Vielma
Juan Pablo Vielma
Email verificata su mit.edu - Home page
TitoloCitata daAnno
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
2482010
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
JP Vielma, GL Nemhauser
Mathematical Programming 128 (1-2), 49-72, 2011
2072011
Mixed integer linear programming formulation techniques
JP Vielma
SIAM Review 57 (1), 3-57, 2015
1462015
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
1452008
Imposing Connectivity Constraints in Forest Planning Models
R Carvajal, M Constantino, M Goycoolea, JP Vielma, A Weintraub
Operations Research 61 (4), 824-836, 2013
802013
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
662009
Fitting Piecewise Linear Continuous Functions
A Toriello, JP Vielma
European Journal of Operational Research 219 (1), 86-95, 2010
552010
The split closure of a strictly convex body
D Dadush, SS Dey, JP Vielma
Operations Research Letters 39 (2), 121-126, 2011
512011
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
452016
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
412007
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
382015
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
JP Vielma, GL Nemhauser
International Conference on Integer Programming and Combinatorialá…, 2008
36*2008
Extended formulations in mixed-integer convex programming
M Lubin, E Yamangil, R Bent, JP Vielma
International Conference on Integer Programming and Combinatorialá…, 2016
352016
A constructive characterization of the split closure of a mixed integer linear program
JP Vielma
Operations Research Letters 35 (1), 29-35, 2007
322007
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
312014
Extended formulations in mixed integer conic quadratic programming
JP Vielma, I Dunning, J Huchette, M Lubin
Mathematical Programming Computation 9, 369-418, 2017
262017
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
22*2011
Polyhedral approximation in mixed-integer convex optimization
M Lubin, E Yamangil, R Bent, JP Vielma
Mathematical Programming 172 (1-2), 139-168, 2018
212018
Incremental and encoding formulations for mixed integer programming
S Yıldız, JP Vielma
Operations Research Letters 41 (6), 654-658, 2013
212013
Il sistema al momento non pu˛ eseguire l'operazione. Riprova pi¨ tardi.
Articoli 1–20