Juan Pablo Vielma

According to our database1, Juan Pablo Vielma authored at least 43 papers between 2007 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Outer approximation with conic certificates for mixed-integer convex problems.
Math. Program. Comput., 2020

Strong mixed-integer programming formulations for trained neural networks.
Math. Program., 2020

Learning in Combinatorial Optimization: What and How to Explore.
Oper. Res., 2020

The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification.
CoRR, 2020

A geometric way to build strong mixed-integer programming formulations.
Oper. Res. Lett., 2019

Small and strong formulations for unions of convex sets from the Cayley embedding.
Math. Program., 2019

A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints.
Math. Oper. Res., 2019

Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis.
Oper. Res., 2019

Strong Mixed-Integer Programming Formulations for Trained Neural Networks.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Polyhedral approximation in mixed-integer convex optimization.
Math. Program., 2018

Embedding Formulations and Complexity for Unions of Polyhedra.
Manag. Sci., 2018

Beating the SDP bound for the floor layout problem: a simple combinatorial idea.
INFOR Inf. Syst. Oper. Res., 2018

Strong mixed-integer formulations for the floor layout problem.
INFOR Inf. Syst. Oper. Res., 2018

Dynamic Automatic Differentiation of GPU Broadcast Kernels.
CoRR, 2018

Extended formulations in mixed integer conic quadratic programming.
Math. Program. Comput., 2017

Convex hull of two quadratic or a conic quadratic and a quadratic inequality.
Math. Program., 2017

Mixed-Integer Convex Representability.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

On packing and covering polyhedra in infinite dimensions.
Oper. Res. Lett., 2016

Intersection cuts for nonlinear integer programming: convexification techniques for structured sets.
Math. Program., 2016

Predicting Performance Under Stressful Conditions Using Galvanic Skin Response.
CoRR, 2016

Extended Formulations in Mixed-Integer Convex Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Mixed Integer Linear Programming Formulation Techniques.
SIAM Rev., 2015

Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming.
Oper. Res. Lett., 2015

Restricted risk measures and robust optimization.
Eur. J. Oper. Res., 2015

On the Chvátal-Gomory closure of a compact convex set.
Math. Program., 2014

Computational Experiments with Cross and Crooked Cross Cuts.
INFORMS J. Comput., 2014

Incremental and encoding formulations for Mixed Integer Programming.
Oper. Res. Lett., 2013

Imposing Connectivity Constraints in Forest Planning Models.
Oper. Res., 2013

A Strong Dual for Conic Mixed-Integer Programs.
SIAM J. Optim., 2012

Mixed integer linear programming formulations for probabilistic constraints.
Oper. Res. Lett., 2012

An integer linear programming approach for bilinear integer programming.
Oper. Res. Lett., 2012

Fitting piecewise linear continuous functions.
Eur. J. Oper. Res., 2012

The split closure of a strictly convex body.
Oper. Res. Lett., 2011

Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.
Math. Program., 2011

The Chvátal-Gomory Closure of a Strictly Convex Body.
Math. Oper. Res., 2011

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions.
Oper. Res., 2010

A Note on "A Superior Representation Method for Piecewise Linear Functions".
INFORMS J. Comput., 2010

The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Mixed integer programming approaches for nonlinear and stochastic programming.
PhD thesis, 2009

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs.
INFORMS J. Comput., 2008

Nonconvex, lower semicontinuous piecewise linear optimization.
Discret. Optim., 2008

A constructive characterization of the split closure of a mixed integer linear program.
Oper. Res. Lett., 2007

Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems.
Eur. J. Oper. Res., 2007