Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. - Pierre Bonami; Michel Minoux (Discret. Optim., 2005)

Exact MAX-2SAT solution via lift-and-project closure. - Pierre Bonami; Michel Minoux (Oper. Res. Lett., 2006)

New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing. - Egon Balas; Pierre Bonami (IPCO, 2007)

Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. - Anureet Saxena; Pierre Bonami; Jon Lee 001 (IPCO, 2008)

An algorithmic framework for convex mixed integer nonlinear programs. - Pierre Bonami; Lorenz T. Biegler; Andrew R. Conn; Gérard Cornuéjols; Ignacio E. Grossmann; Carl D. Laird; Jon Lee 001; Andrea Lodi 001; François Margot; Nicolas W. Sawaya; Andreas Wächter (Discret. Optim., 2008)

Projected Chvátal-Gomory cuts for mixed integer linear programs. - Pierre Bonami; Gérard Cornuéjols; Sanjeeb Dash; Matteo Fischetti; Andrea Lodi 001 (Math. Program., 2008)

A note on the MIR closure. - Pierre Bonami; Gérard Cornuéjols (Oper. Res. Lett., 2008)

An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints. - Pierre Bonami; Miguel A. Lejeune (Oper. Res., 2009)

A Feasibility Pump for mixed integer nonlinear programs. - Pierre Bonami; Gérard Cornuéjols; Andrea Lodi 001; François Margot (Math. Program., 2009)

Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants. - Egon Balas; Pierre Bonami (Math. Program. Comput., 2009)

Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications. - Hassan L. Hijazi; Pierre Bonami; Gérard Cornuéjols; Adam Ouorou (Electron. Notes Discret. Math., 2010)

Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. - Anureet Saxena; Pierre Bonami; Jon Lee 001 (Math. Program., 2010)

Lift-and-Project Cuts for Mixed Integer Convex Programs. - Pierre Bonami (IPCO, 2011)

Experiments with Two-Row Cuts from Degenerate Tableaux. - Amitabh Basu; Pierre Bonami; Gérard Cornuéjols; François Margot (INFORMS J. Comput., 2011)

On the relative strength of split, triangle and quadrilateral cuts. - Amitabh Basu; Pierre Bonami; Gérard Cornuéjols; François Margot (Math. Program., 2011)

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. - Anureet Saxena; Pierre Bonami; Jon Lee 001 (Math. Program., 2011)

On the Solution of a Graph Partitioning Problem under Capacity Constraints. - Pierre Bonami; Viet Hung Nguyen; Michel Klein; Michel Minoux (ISCO, 2012)

Heuristics for convex mixed integer nonlinear programs. - Pierre Bonami; João P. M. Gonçalves (Comput. Optim. Appl., 2012)

Mixed-integer nonlinear programs featuring "on/off" constraints. - Hassan L. Hijazi; Pierre Bonami; Gérard Cornuéjols; Adam Ouorou (Comput. Optim. Appl., 2012)

Preface. - Pierre Bonami; Leo Liberti; Andrew J. Miller; Annick Sartenaer (Math. Program., 2012)

On optimizing over lift-and-project closures. - Pierre Bonami (Math. Program. Comput., 2012)

Robust delay-constrained routing in telecommunications. - Hassan L. Hijazi; Pierre Bonami; Adam Ouorou (Ann. Oper. Res., 2013)

On branching rules for convex mixed-integer nonlinear optimization. - Pierre Bonami; Jon Lee 001; Sven Leyffer; Andreas Wächter (ACM J. Exp. Algorithmics, 2013)

Cutting planes from two-term disjunctions. - Pierre Bonami; Michele Conforti; Gérard Cornuéjols; Marco Molinaro 001; Giacomo Zambelli (Oper. Res. Lett., 2013)

An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs. - Hassan L. Hijazi; Pierre Bonami; Adam Ouorou (INFORMS J. Comput., 2014)

Energy-Optimal Multi-Goal Motion Planning for Planar Robot Manipulators. - Pierre Bonami; Alberto Olivares; Ernesto Staffetti (J. Optim. Theory Appl., 2014)

On mathematical programming with indicator constraints. - Pierre Bonami; Andrea Lodi 001; Andrea Tramontani; Sven Wiese (Math. Program., 2015)

Cut generation through binarization. - Pierre Bonami; François Margot (Math. Program., 2015)

On handling indicator constraints in mixed integer programming. - Pietro Belotti; Pierre Bonami; Matteo Fischetti; Andrea Lodi 001; Michele Monaci; Amaya Nogales-Gómez; Domenico Salvagnin (Comput. Optim. Appl., 2016)

Cutting Planes from Wide Split Disjunctions. - Pierre Bonami; Andrea Lodi 001; Andrea Tramontani; Sven Wiese (IPCO, 2017)

Maximum flow under proportional delay constraint. - Pierre Bonami; Dorian Mazauric; Yann Vaxès (Theor. Comput. Sci., 2017)

Learning a Classification of Mixed-Integer Quadratic Programming Problems. - Pierre Bonami; Andrea Lodi 001; Giulia Zarpellon (CPAIOR, 2018)

Designing and Implementing Algorithms for Mixed-Integer Nonlinear Optimization (Dagstuhl Seminar 18081). - Pierre Bonami; Ambros M. Gleixner; Jeff T. Linderoth; Ruth Misener (Dagstuhl Reports, 2018)

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. - Pierre Bonami; Oktay Günlük; Jeff T. Linderoth (Math. Program. Comput., 2018)

Solving Quadratic Programming by Cutting Planes. - Pierre Bonami; Andrea Lodi 001; Jonas Schweiger; Andrea Tramontani (SIAM J. Optim., 2019)

Implementing Automatic Benders Decomposition in a Modern MIP Solver. - Pierre Bonami; Domenico Salvagnin; Andrea Tramontani (IPCO, 2020)

A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX. - Pierre Bonami; Andrea Lodi 001; Giulia Zarpellon (Oper. Res., 2022)