Hot stuff

  1. P. Bonami. On optimizing over lift-and-project closures. Research Report, hal-00529816, October 2010, revised November 2011.
  2. P. Bonami. Lift-and-Project Cuts for Mixed Integer Convex Programs. IPCO 2011, June 2011. O. Günlük and G. J. Woeginger eds., LNCS 6655 (2011) IPCO version.

Journals

  1. P. Bonami et M. Minoux. Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. Discrete Optimization,2, 288-307, 2005.
  2. P. Bonami et M. Minoux. Exact MAX-2SAT solution via lift-and-proect closure. Operations Research Letters, 34(4): 387-393, 2006.
  3. P. Bonami, G. Cornuéjols. S. Dash, M. Fischetti. A. Lodi Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Programming 113(2):241-257,2008.
  4. P. Bonami, L. T. Biegler, A. R. Conn, G. Cornuéjols, I.E. Grossmann, Carl D. Laird, Jon Lee, A. Lodi, F. Margot, N. Sawaya, A. Wächter, An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs. Discrete Optimization, 5(2):186-204,2008.
  5. P. Bonami, G. Cornuéjols. A Note on the MIR closure. OR Letters, 36(1) 4-6, 2008.
  6. P. Bonami, G. Cornuéjols, A. Lodi, F. Margot. A feasibility pump for Mixed Integer Nonlinear Programming. Math. Programming, 119(2):331-352, 2009..
  7. P. Bonami, M.A. Lejeune. An Exact Solution Approach for Integer Constrained Portfolio Optimization Problems Under Stochastic Constraints. Operations Research 57(3):650-670, 2009.
  8. A. Saxena, P. Bonami and J. Lee. Convex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Programs: Extended Formulations. Math. Programming B, 124: 383-411, 2010. Version with all tables of results: IBM Research Report RC24621.
  9. A. Basu, P. Bonami, G. Cornuéjols and F. Margot. On the Relative Strength of Split, Triangle and Quadrilateral Cuts. Math. Programming A, On line first, in press.
  10. A. Saxena, P. Bonami and J. Lee. Convex Relaxations of Non-Convex Mixed Integer Quadratically Constrained Programs: Projected Formulations. Math. Programming A, On line first, in press..
  11. E. Balas, P. Bonami. Generating Lift-and-Project Cut from the LP Simplex Tableau: Open Source Implementation and Testing of New Variants. Math. Programming Computations 2-3:165-199, 2009.
  12. P. Bonami, J P. M. Gonçalves. Heuristics for convex mixed integer nonlinear programs. Computational Optimization and Applications, accepted for publication On line first, in press.
  13. A. Basu, P. Bonami, G. Cornuéjols and F. Margot. Experiments with two-row cuts from degenerate tableaus. INFORMS Journal on Computing, in press.
  14. H. Hijazi, P. Bonami, G. Cornuéjols and A. Ouorou. Mixed Integer NonLinear Programs featuring "On/Off" constraints. Computational Optimization and Applications, accepted for publication.

International conference with proceedings

  1. P. Bonami and M. Minoux. A Computational Investigation of Cutting Planes and Relaxations for General Mixed 0-1 Integer Problems. MCO2004, L. THI, P. D. TAO (editors). Hermes science, LITA - UFR MIM Universite de Metz, France, July 2004.
  2. E. Balas, P. Bonami. New variants of lift-and-project cut generation from the LP tableau: open source implementation and testing. IPCO2007, June 2007, Cornell University.
  3. A. Saxena, P. Bonami and J. Lee. Disjunctive Cuts for Non-Convex Mixed Integer Quadratically Constrained Programs. IPCO2008, May 2008, Bologna.
  4. A. Basu, P. Bonami, G. Cornuéjols and F. Margot. On the Relative Strength of Split, Triangle and Quadrilateral Cuts. SODA 2009
  5. P. Bonami. Lift-and-Project Cuts for Mixed Integer Convex Programs. IPCO 2011, June 2011. O. Günlük and G. J. Woeginger eds., LNCS 6655 (2011) IPCO version.

Publicly available Software

  1. P. Bonami, J.J Forrest, L. Ladanyi, J. Lee, F. Margot, A. Wächter. Bonmin: Basic open-source Mixed INteger solver. http://www.coin-or.org/Bonmin. Also available through NEOS optimizations solver web service.
  2. P. Bonami. CglLandP. Efficient cut generator for lift-and-project. https://projects.coin-or.org/Cgl/wiki/CglLandP

Chapter of Book

  1. P. Bonami and M. Minoux. Une comparaison de quelques méthodes de génération d'inégalités valides pour des problèmes entiers 0-1 généraux. Optimisation combinatoire 3 : applications. V. Paschos editor. Hermes. December 2005.
  2. P. Bonami and M. Minoux. Comparison of some valid inequality generation methods for general 0-1 problems, in Applications of Combinatorial Optimization, V. Paschos editor, ISTE-Wiley 2010.
  3. P. Bonami, M. Kilinc, and J. T. Linderoth, "Algorithms and Software for Solving Convex Mixed Integer Nonlinear Programs," IMA Volumes, to appear, 2010. Preprint

Ph.D. Thesis

  1. P. Bonami. Étude et mise en oeuvre d'approches polyédriques pour la résolution de programmes en nombres entiers ou mixtes généraux. Université Paris 6, sous la direction de M. Minoux. Octobre 2003. ici

Unpublished

  1. P. Bonami M. Minoux. Lift-and-project closure and RLT relaxation for MAX-2-SAT and quadratic 0-1 problems, 2006.

Synergistic

  1. P. Bonami, J. Lee. Bonmin User's Manual. July 2006.
  2. P. Bonami, John J. Forrest, J. Lee. and A. Wächter. Rapid Developmnent of an Open-Source Minlp Solver with COIN-OR. Optima 75, December 2007, 1-4.