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

Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming

(2015) Sina Modaresi et al.   OPERATIONS RESEARCH LETTERS

Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets

(2014) Daniel Bienstock et al.   SIAM JOURNAL ON OPTIMIZATION

On families of quadratic surfaces having fixed intersections with two hyperplanes

(2013) Pietro Belotti et al.   DISCRETE APPLIED MATHEMATICS

Relaxations of mixed integer sets from lattice-free polyhedra

(2012) Alberto Del Pia et al.   4OR-A Quarterly Journal of Operations Research

A Strong Dual for Conic Mixed-Integer Programs

(2012) Diego A. Morán R. et al.   SIAM JOURNAL ON OPTIMIZATION

Semidefinite Representation of Convex Hulls of Rational Varieties

(2011) Didier Henrion   ACTA APPLICANDAE MATHEMATICAE

On the convex hull of a space curve

(2011) Kristian Ranestad et al.   ADVANCES IN GEOMETRY

Convex hulls of curves of genus one

(2011) Claus Scheiderer   ADVANCES IN MATHEMATICS

Generalized intersection cuts and a new cut generating paradigm

(2011) Egon Balas et al.   MATHEMATICAL PROGRAMMING

Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra

(2011) Sanjeeb Dash et al.   MATHEMATICAL PROGRAMMING

An effective branch-and-bound algorithm for convex quadratic integer programming

(2011) Christoph Buchheim et al.   MATHEMATICAL PROGRAMMING

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

(2011) Daniel Dadush et al.   MATHEMATICS OF OPERATIONS RESEARCH

The split closure of a strictly convex body

(2011) D. Dadush et al.   OPERATIONS RESEARCH LETTERS

A note on the MIR closure and basic relaxations of polyhedra

(2011) Sanjeeb Dash et al.   OPERATIONS RESEARCH LETTERS

ORBITOPES

(2011) Raman Sanyal et al.   MATHEMATIKA

Extending the QCR method to general mixed-integer programs

(2010) Alain Billionnet et al.   MATHEMATICAL PROGRAMMING

An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets

(2010) Kent Andersen et al.   MATHEMATICS OF OPERATIONS RESEARCH

Convex hull of two quadratic constraints is an LMI set

(2009) U. Yildiran   IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

(2008) Alain Billionnet et al.   DISCRETE APPLIED MATHEMATICS

Cook, Kannan and Schrijver’s example revisited

(2008) Yanjun Li et al.   Discrete Optimization

Conic mixed-integer rounding cuts

(2008) Alper Atamtürk et al.   MATHEMATICAL PROGRAMMING