| Publication | Date of Publication | Type |
|---|
| Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools | 2024-03-12 | Paper |
| Conic Optimization with Spectral Functions on Euclidean Jordan Algebras | 2024-03-01 | Paper |
| Shapes and recession cones in mixed-integer convex representability | 2024-02-21 | Paper |
| JuMP 1.0: recent improvements to a modeling language for mathematical optimization | 2023-09-08 | Paper |
| Performance enhancements for a generic conic interior point algorithm | 2023-06-23 | Paper |
| Disjunctive cuts in mixed-integer conic optimization | 2023-05-02 | Paper |
| Sum of squares generalizations for conic sets | 2023-05-02 | Paper |
| Strong mixed-integer formulations for the floor layout problem | 2023-03-15 | Paper |
| Beating the SDP bound for the floor layout problem: a simple combinatorial idea | 2023-03-15 | Paper |
| Solving Natural Conic Formulations with Hypatia.jl | 2022-12-01 | Paper |
| Mixed-Integer Convex Representability | 2022-05-17 | Paper |
| Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies | 2022-03-30 | Paper |
| Computing conjugate barrier information for nonsymmetric cones | 2022-01-11 | Paper |
| Constrained Discrete Black-Box Optimization using Mixed-Integer Programming | 2021-10-18 | Paper |
| Learning in Combinatorial Optimization: What and How to Explore | 2021-01-19 | Paper |
| Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis | 2020-10-20 | Paper |
| Outer approximation with conic certificates for mixed-integer convex problems | 2020-08-27 | Paper |
| Solving natural conic formulations with Hypatia.jl | 2020-05-03 | Paper |
| A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints | 2020-04-30 | Paper |
| A geometric way to build strong mixed-integer programming formulations | 2020-02-10 | Paper |
| Small and strong formulations for unions of convex sets from the Cayley embedding | 2019-08-06 | Paper |
| Polyhedral approximation in mixed-integer convex optimization | 2018-10-26 | Paper |
| On packing and covering polyhedra in infinite dimensions | 2018-10-01 | Paper |
| Split cuts and extended formulations for mixed integer conic quadratic programming | 2018-09-28 | Paper |
| Extended formulations in mixed integer conic quadratic programming | 2018-01-08 | Paper |
| A mixed-integer branching approach for very small formulations of disjunctive constraints | 2017-09-28 | Paper |
| Mixed-integer convex representability | 2017-08-31 | Paper |
| Convex hull of two quadratic or a conic quadratic and a quadratic inequality | 2017-07-21 | Paper |
| Extended Formulations in Mixed-Integer Convex Programming | 2016-08-10 | Paper |
| Restricted risk measures and robust optimization | 2016-07-06 | Paper |
| Mixed Integer Linear Programming Formulation Techniques | 2016-05-20 | Paper |
| Beating the SDP bound for the floor layout problem: A simple combinatorial idea | 2016-02-25 | Paper |
| Intersection cuts for nonlinear integer programming: convexification techniques for structured sets | 2016-02-23 | Paper |
| Two-sided linear chance constraints and extensions | 2015-07-07 | Paper |
| Embedding Formulations and Complexity for Unions of Polyhedra | 2015-06-03 | Paper |
| Computational Experiments with Cross and Crooked Cross Cuts | 2015-01-26 | Paper |
| On the Chvátal-Gomory closure of a compact convex set | 2014-06-27 | Paper |
| Imposing Connectivity Constraints in Forest Planning Models | 2014-06-26 | Paper |
| Incremental and encoding formulations for mixed integer programming | 2014-05-15 | Paper |
| A Strong Dual for Conic Mixed-Integer Programs | 2013-01-04 | Paper |
| Mixed integer linear programming formulations for probabilistic constraints | 2012-08-17 | Paper |
| Fitting piecewise linear continuous functions | 2012-08-16 | Paper |
| A Note on “A Superior Representation Method for Piecewise Linear Functions” | 2012-07-28 | Paper |
| A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs | 2012-07-28 | Paper |
| An integer linear programming approach for bilinear integer programming | 2012-07-12 | Paper |
| The Chvátal-Gomory Closure of a Strictly Convex Body | 2012-05-24 | Paper |
| Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions | 2011-11-24 | Paper |
| The split closure of a strictly convex body | 2011-08-09 | Paper |
| On the Chvátal-Gomory Closure of a Compact Convex Set | 2011-06-24 | Paper |
| Modeling disjunctive constraints with a logarithmic number of binary variables and constraints | 2011-06-17 | Paper |
| The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron | 2010-06-22 | Paper |
| Nonconvex, lower semicontinuous piecewise linear optimization | 2008-10-29 | Paper |
| Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints | 2008-06-10 | Paper |
| A constructive characterization of the split closure of a mixed integer linear program | 2007-08-27 | Paper |
| Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems | 2006-11-15 | Paper |
