| Publication | Date of Publication | Type |
|---|
Computing conjugate barrier information for nonsymmetric cones
Journal of Optimization Theory and Applications | 2024-09-02 | Paper |
Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools
Operations Research | 2024-03-12 | Paper |
Conic Optimization with Spectral Functions on Euclidean Jordan Algebras
Mathematics of Operations Research | 2024-03-01 | Paper |
Shapes and recession cones in mixed-integer convex representability
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
JuMP 1.0: recent improvements to a modeling language for mathematical optimization
Mathematical Programming Computation | 2023-09-08 | Paper |
Performance enhancements for a generic conic interior point algorithm
Mathematical Programming Computation | 2023-06-23 | Paper |
Disjunctive cuts in mixed-integer conic optimization
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Disjunctive cuts in mixed-integer conic optimization
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Sum of squares generalizations for conic sets
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Strong mixed-integer formulations for the floor layout problem
INFOR: Information Systems and Operational Research | 2023-03-15 | Paper |
Beating the SDP bound for the floor layout problem: a simple combinatorial idea
INFOR: Information Systems and Operational Research | 2023-03-15 | Paper |
Solving Natural Conic Formulations with Hypatia.jl
INFORMS Journal on Computing | 2022-12-01 | Paper |
Mixed-integer convex representability
Mathematics of Operations Research | 2022-05-17 | Paper |
Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies
Journal of Computational and Graphical Statistics | 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
Operations Research | 2021-01-19 | Paper |
Ellipsoidal methods for adaptive choice-based conjoint analysis
Operations Research | 2020-10-20 | Paper |
Strong mixed-integer programming formulations for trained neural networks
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Outer approximation with conic certificates for mixed-integer convex problems
Mathematical Programming Computation | 2020-08-27 | Paper |
Solving natural conic formulations with Hypatia.jl
(available as arXiv preprint) | 2020-05-03 | Paper |
A combinatorial approach for small and strong formulations of disjunctive constraints
Mathematics of Operations Research | 2020-04-30 | Paper |
A geometric way to build strong mixed-integer programming formulations
Operations Research Letters | 2020-02-10 | Paper |
Strong mixed-integer programming formulations for trained neural networks
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Small and strong formulations for unions of convex sets from the Cayley embedding
Mathematical Programming. Series A. Series B | 2019-08-06 | Paper |
Polyhedral approximation in mixed-integer convex optimization
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
On packing and covering polyhedra in infinite dimensions
Operations Research Letters | 2018-10-01 | Paper |
Split cuts and extended formulations for mixed integer conic quadratic programming
Operations Research Letters | 2018-09-28 | Paper |
Extended formulations in mixed integer conic quadratic programming
Mathematical Programming Computation | 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 |
Mixed-integer convex representability
(available as arXiv preprint) | 2017-08-31 | Paper |
Convex hull of two quadratic or a conic quadratic and a quadratic inequality
Mathematical Programming. Series A. Series B | 2017-07-21 | Paper |
Extended formulations in mixed-integer convex programming
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Extended formulations in mixed-integer convex programming
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Restricted risk measures and robust optimization
European Journal of Operational Research | 2016-07-06 | Paper |
Mixed integer linear programming formulation techniques
SIAM Review | 2016-05-20 | Paper |
Beating the SDP bound for the floor layout problem: A simple combinatorial idea
(available as arXiv preprint) | 2016-02-25 | Paper |
Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
Mathematical Programming. Series A. Series B | 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
INFORMS Journal on Computing | 2015-01-26 | Paper |
On the Chvátal-Gomory closure of a compact convex set
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
Imposing Connectivity Constraints in Forest Planning Models
Operations Research | 2014-06-26 | Paper |
Imposing Connectivity Constraints in Forest Planning Models
Operations Research | 2014-06-26 | Paper |
Incremental and encoding formulations for mixed integer programming
Operations Research Letters | 2014-05-15 | Paper |
A strong dual for conic mixed-integer programs
SIAM Journal on Optimization | 2013-01-04 | Paper |
Mixed integer linear programming formulations for probabilistic constraints
Operations Research Letters | 2012-08-17 | Paper |
Fitting piecewise linear continuous functions
European Journal of Operational Research | 2012-08-16 | Paper |
A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
INFORMS Journal on Computing | 2012-07-28 | Paper |
A note on ``A superior representation method for piecewise linear functions
INFORMS Journal on Computing | 2012-07-28 | Paper |
An integer linear programming approach for bilinear integer programming
Operations Research Letters | 2012-07-12 | Paper |
The Chvátal-Gomory closure of a strictly convex body
Mathematics of Operations Research | 2012-05-24 | Paper |
Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
Operations Research | 2011-11-24 | Paper |
The split closure of a strictly convex body
Operations Research Letters | 2011-08-09 | Paper |
On the Chvátal-Gomory closure of a compact convex set
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Nonconvex, lower semicontinuous piecewise linear optimization
Discrete Optimization | 2008-10-29 | Paper |
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
A constructive characterization of the split closure of a mixed integer linear program
Operations Research Letters | 2007-08-27 | Paper |
Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
European Journal of Operational Research | 2006-11-15 | Paper |
