Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems. - Juan Pablo Vielma; Alan T. Murray; David M. Ryan; Andrés Weintraub (Eur. J. Oper. Res., 2007)

A constructive characterization of the split closure of a mixed integer linear program. - Juan Pablo Vielma (Oper. Res. Lett., 2007)

Nonconvex, lower semicontinuous piecewise linear optimization. - Juan Pablo Vielma; Ahmet B. Keha; George L. Nemhauser (Discret. Optim., 2008)

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs. - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (INFORMS J. Comput., 2008)

Mixed integer programming approaches for nonlinear and stochastic programming. - Juan Pablo Vielma Centeno (2009)

The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron. - Santanu S. Dey; Juan Pablo Vielma (IPCO, 2010)

A Note on "A Superior Representation Method for Piecewise Linear Functions". - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (INFORMS J. Comput., 2010)

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions. - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res., 2010)

The Chvátal-Gomory Closure of a Strictly Convex Body. - Daniel Dadush; Santanu S. Dey; Juan Pablo Vielma (Math. Oper. Res., 2011)

Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. - Juan Pablo Vielma; George L. Nemhauser (Math. Program., 2011)

The split closure of a strictly convex body. - Daniel Dadush; Santanu S. Dey; Juan Pablo Vielma (Oper. Res. Lett., 2011)

Fitting piecewise linear continuous functions. - Alejandro Toriello; Juan Pablo Vielma (Eur. J. Oper. Res., 2012)

An integer linear programming approach for bilinear integer programming. - Alexandre S. Freire; Eduardo Moreno 001; Juan Pablo Vielma (Oper. Res. Lett., 2012)

Mixed integer linear programming formulations for probabilistic constraints. - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res. Lett., 2012)

A Strong Dual for Conic Mixed-Integer Programs. - Diego A. Morán R.; Santanu S. Dey; Juan Pablo Vielma (SIAM J. Optim., 2012)

Imposing Connectivity Constraints in Forest Planning Models. - Rodolfo Carvajal; Miguel Constantino; Marcos Goycoolea; Juan Pablo Vielma; Andrés Weintraub (Oper. Res., 2013)

Incremental and encoding formulations for Mixed Integer Programming. - Sercan Yildiz; Juan Pablo Vielma (Oper. Res. Lett., 2013)

Computational Experiments with Cross and Crooked Cross Cuts. - Sanjeeb Dash; Oktay Günlük; Juan Pablo Vielma (INFORMS J. Comput., 2014)

On the Chvátal-Gomory closure of a compact convex set. - Daniel Dadush; Santanu S. Dey; Juan Pablo Vielma (Math. Program., 2014)

Restricted risk measures and robust optimization. - Guido Lagos; Daniel G. Espinoza; Eduardo Moreno 001; Juan Pablo Vielma (Eur. J. Oper. Res., 2015)

Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming. - Sina Modaresi; Mustafa R. Kilinç; Juan Pablo Vielma (Oper. Res. Lett., 2015)

Mixed Integer Linear Programming Formulation Techniques. - Juan Pablo Vielma (SIAM Rev., 2015)

Extended Formulations in Mixed-Integer Convex Programming. - Miles Lubin; Emre Yamangil; Russell Bent; Juan Pablo Vielma (IPCO, 2016)

Predicting Performance Under Stressful Conditions Using Galvanic Skin Response. - Carter Mundell; Juan Pablo Vielma; Tauhid Zaman (CoRR, 2016)

Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. - Sina Modaresi; Mustafa R. Kilinç; Juan Pablo Vielma (Math. Program., 2016)

On packing and covering polyhedra in infinite dimensions. - Luis Rademacher; Alejandro Toriello; Juan Pablo Vielma (Oper. Res. Lett., 2016)

Convex hull of two quadratic or a conic quadratic and a quadratic inequality. - Sina Modaresi; Juan Pablo Vielma (Math. Program., 2017)

Extended formulations in mixed integer conic quadratic programming. - Juan Pablo Vielma; Iain Dunning; Joey Huchette; Miles Lubin (Math. Program. Comput., 2017)

Dynamic Automatic Differentiation of GPU Broadcast Kernels. - Jarrett Revels; Tim Besard; Valentin Churavy; Bjorn De Sutter; Juan Pablo Vielma (CoRR, 2018)

Strong mixed-integer formulations for the floor layout problem. - Joey Huchette; Santanu S. Dey; Juan Pablo Vielma (INFOR Inf. Syst. Oper. Res., 2018)

Beating the SDP bound for the floor layout problem: a simple combinatorial idea. - Joey Huchette; Santanu S. Dey; Juan Pablo Vielma (INFOR Inf. Syst. Oper. Res., 2018)

Embedding Formulations and Complexity for Unions of Polyhedra. - Juan Pablo Vielma (Manag. Sci., 2018)

Polyhedral approximation in mixed-integer convex optimization. - Miles Lubin; Emre Yamangil; Russell Bent; Juan Pablo Vielma (Math. Program., 2018)

Strong Mixed-Integer Programming Formulations for Trained Neural Networks. - Ross Anderson; Joey Huchette; Christian Tjandraatmadja; Juan Pablo Vielma (IPCO, 2019)

Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis. - Denis Sauré; Juan Pablo Vielma (Oper. Res., 2019)

A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints. - Joey Huchette; Juan Pablo Vielma (Math. Oper. Res., 2019)

Small and strong formulations for unions of convex sets from the Cayley embedding. - Juan Pablo Vielma (Math. Program., 2019)

A geometric way to build strong mixed-integer programming formulations. - Joey Huchette; Juan Pablo Vielma (Oper. Res. Lett., 2019)

The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. - Christian Tjandraatmadja; Ross Anderson; Joey Huchette; Will Ma; Krunal Patel; Juan Pablo Vielma (NeurIPS, 2020)

Learning in Combinatorial Optimization: What and How to Explore. - Sajad Modaresi; Denis Sauré; Juan Pablo Vielma (Oper. Res., 2020)

Strong mixed-integer programming formulations for trained neural networks. - Ross Anderson; Joey Huchette; Will Ma; Christian Tjandraatmadja; Juan Pablo Vielma (Math. Program., 2020)

Outer approximation with conic certificates for mixed-integer convex problems. - Chris Coey; Miles Lubin; Juan Pablo Vielma (Math. Program. Comput., 2020)

Constrained Discrete Black-Box Optimization using Mixed-Integer Programming. - Theodore P. Papalexopoulos; Christian Tjandraatmadja; Ross Anderson; Juan Pablo Vielma; David Belanger 002 (ICML, 2022)

JuMP 1.0. - Miles Lubin; Oscar Dowson; Joaquim Dias Garcia; Joey Huchette; Benoît Legat; Juan Pablo Vielma (CoRR, 2022)

Solving Natural Conic Formulations with Hypatia.jl. - Chris Coey; Lea Kapelevich; Juan Pablo Vielma (INFORMS J. Comput., 2022)

Mixed-Integer Convex Representability. - Miles Lubin; Juan Pablo Vielma; Ilias Zadik (Math. Oper. Res., 2022)

Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools. - Joey Huchette; Juan Pablo Vielma (Oper. Res., 2023)

Conic Optimization with Spectral Functions on Euclidean Jordan Algebras. - Chris Coey; Lea Kapelevich; Juan Pablo Vielma (Math. Oper. Res., 2023)

Performance enhancements for a generic conic interior point algorithm. - Chris Coey; Lea Kapelevich; Juan Pablo Vielma (Math. Program. Comput., 2023)

Sum of squares generalizations for conic sets. - Lea Kapelevich; Chris Coey; Juan Pablo Vielma (Math. Program., 2023)

Disjunctive cuts in Mixed-Integer Conic Optimization. - Andrea Lodi 001; Mathieu Tanneau; Juan Pablo Vielma (Math. Program., 2023)

JuMP 1.0: recent improvements to a modeling language for mathematical optimization. - Miles Lubin; Oscar Dowson; Joaquim Dias Garcia; Joey Huchette; Benoît Legat; Juan Pablo Vielma (Math. Program. Comput., 2023)

Shapes and recession cones in mixed-integer convex representability. - Ilias Zadik; Miles Lubin; Juan Pablo Vielma (Math. Program., 2024)

Computing Conjugate Barrier Information for Nonsymmetric Cones. - Lea Kapelevich; Erling D. Andersen; Juan Pablo Vielma (J. Optim. Theory Appl., 2024)