Juan Pablo Vielma

Erling D. Andersen

J. Optim. Theory Appl., July, 2024

Shapes and recession cones in mixed-integer convex representability.

[BibT_eX]

[DOI]

Ilias Zadik

Miles Lubin

Math. Program., March, 2024

2023

JuMP 1.0: recent improvements to a modeling language for mathematical optimization.

[BibT_eX]

[DOI]

Math. Program. Comput., September, 2023

Disjunctive cuts in Mixed-Integer Conic Optimization.

[BibT_eX]

[DOI]

Andrea Lodi

Mathieu Tanneau

Math. Program., May, 2023

Sum of squares generalizations for conic sets.

[BibT_eX]

[DOI]

Math. Program., May, 2023

Performance enhancements for a generic conic interior point algorithm.

[BibT_eX]

[DOI]

Math. Program. Comput., March, 2023

Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools.

[BibT_eX]

[DOI]

Oper. Res., 2023

2022

Mixed-Integer Convex Representability.

[BibT_eX]

[DOI]

Miles Lubin

Ilias Zadik

Math. Oper. Res., 2022

Solving Natural Conic Formulations with Hypatia.jl.

[BibT_eX]

[DOI]

Theodore P. Papalexopoulos

INFORMS J. Comput., 2022

JuMP 1.0.

[BibT_eX]

[DOI]

CoRR, 2022

Constrained Discrete Black-Box Optimization using Mixed-Integer Programming.

[BibT_eX]

[DOI]

Ross Anderson

David Belanger

Proceedings of the International Conference on Machine Learning, 2022

2020

Outer approximation with conic certificates for mixed-integer convex problems.

[BibT_eX]

[DOI]

Miles Lubin

Math. Program. Comput., 2020

Strong mixed-integer programming formulations for trained neural networks.

[BibT_eX]

[DOI]

Ross Anderson

Will Ma

Math. Program., 2020

Learning in Combinatorial Optimization: What and How to Explore.

[BibT_eX]

[DOI]

Sajad Modaresi

Denis Sauré

Oper. Res., 2020

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

A geometric way to build strong mixed-integer programming formulations.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2019

Small and strong formulations for unions of convex sets from the Cayley embedding.

[BibT_eX]

[DOI]

Math. Program., 2019

A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

Ellipsoidal Methods for Adaptive Choice-Based Conjoint Analysis.

[BibT_eX]

[DOI]

Denis Sauré

Oper. Res., 2019

Strong Mixed-Integer Programming Formulations for Trained Neural Networks.

[BibT_eX]

[DOI]

Ross Anderson

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

Polyhedral approximation in mixed-integer convex optimization.

[BibT_eX]

[DOI]

Math. Program., 2018

Embedding Formulations and Complexity for Unions of Polyhedra.

[BibT_eX]

[DOI]

Manag. Sci., 2018

Beating the SDP bound for the floor layout problem: a simple combinatorial idea.

[BibT_eX]

[DOI]

INFOR Inf. Syst. Oper. Res., 2018

Strong mixed-integer formulations for the floor layout problem.

[BibT_eX]

[DOI]

INFOR Inf. Syst. Oper. Res., 2018

Dynamic Automatic Differentiation of GPU Broadcast Kernels.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Extended formulations in mixed integer conic quadratic programming.

[BibT_eX]

[DOI]

Math. Program. Comput., 2017

Convex hull of two quadratic or a conic quadratic and a quadratic inequality.

[BibT_eX]

[DOI]

Sina Modaresi

Math. Program., 2017

2016

On packing and covering polyhedra in infinite dimensions.

[BibT_eX]

[DOI]

Luis Rademacher

Alejandro Toriello

Oper. Res. Lett., 2016

Intersection cuts for nonlinear integer programming: convexification techniques for structured sets.

[BibT_eX]

[DOI]

Sina Modaresi

Mustafa R. Kilinç

Math. Program., 2016

Predicting Performance Under Stressful Conditions Using Galvanic Skin Response.

[BibT_eX]

[DOI]

Carter Mundell

Tauhid Zaman

CoRR, 2016

Extended Formulations in Mixed-Integer Convex Programming.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015

Mixed Integer Linear Programming Formulation Techniques.

[BibT_eX]

[DOI]

SIAM Rev., 2015

Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming.

[BibT_eX]

[DOI]

Sina Modaresi

Mustafa R. Kilinç

Oper. Res. Lett., 2015

Restricted risk measures and robust optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

2014

On the Chvátal-Gomory closure of a compact convex set.

[BibT_eX]

[DOI]

Daniel Dadush

Math. Program., 2014

Computational Experiments with Cross and Crooked Cross Cuts.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

INFORMS J. Comput., 2014

2013

Incremental and encoding formulations for Mixed Integer Programming.

[BibT_eX]

[DOI]

Sercan Yildiz

Oper. Res. Lett., 2013

Imposing Connectivity Constraints in Forest Planning Models.

[BibT_eX]

[DOI]

Oper. Res., 2013

2012

A Strong Dual for Conic Mixed-Integer Programs.

[BibT_eX]

[DOI]

Diego A. Morán R.

SIAM J. Optim., 2012

Mixed integer linear programming formulations for probabilistic constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2012

An integer linear programming approach for bilinear integer programming.

[BibT_eX]

[DOI]

Alexandre S. Freire

Eduardo Moreno

Oper. Res. Lett., 2012

Fitting piecewise linear continuous functions.

[BibT_eX]

[DOI]

Alejandro Toriello

Eur. J. Oper. Res., 2012

2011

The split closure of a strictly convex body.

[BibT_eX]

[DOI]

Daniel Dadush

Oper. Res. Lett., 2011

Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.

[BibT_eX]

[DOI]

Math. Program., 2011

The Chvátal-Gomory Closure of a Strictly Convex Body.

[BibT_eX]

[DOI]

Daniel Dadush

Math. Oper. Res., 2011

2010

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions.

[BibT_eX]

[DOI]

Oper. Res., 2010

A Note on "A Superior Representation Method for Piecewise Linear Functions".

[BibT_eX]

[DOI]

INFORMS J. Comput., 2010

The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron.

[BibT_eX]

[DOI]

Juan Pablo Vielma Centeno

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Mixed integer programming approaches for nonlinear and stochastic programming.

[BibT_eX]

[DOI]

PhD thesis, 2009

2008

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2008

Nonconvex, lower semicontinuous piecewise linear optimization.

[BibT_eX]

[DOI]

Ahmet B. Keha

Discret. Optim., 2008

2007

A constructive characterization of the split closure of a mixed integer linear program.

[BibT_eX]

[DOI]