Pierre Bonami

Publication List Details

Period

2005 - 2009

Number

10

Co-Authors

Algorithms and Software for Convex Mixed Integer Nonlinear Programs (2009)

Bonami, Pierre, Kilinç, Mustafa, Linderoth, Jeff

This paper provides a survey of recent progress and software for solving mixed integer nonlinear programs (MINLP) wherein the objective and constraints are defined by convex functions and integrality...

Algorithms and Software for Convex Mixed Integer Nonlinear Programs (2009)

Bonami, Pierre, Kilinç, Mustafa, Linderoth, Jeff

This paper provides a survey of recent progress and software for solving mixed integer nonlinear programs (MINLP) wherein the objective and constraints are defined by convex functions and integrality...

Algorithms and Software for Convex Mixed Integer Nonlinear Programs (2009)

Bonami, Pierre, Kilinç, Mustafa, Linderoth, Jeff

This paper provides a survey of recent progress and software for solving mixed integer nonlinear programs (MINLP) wherein the objective and constraints are defined by convex functions and integrality...

Algorithms and Software for Convex Mixed Integer Nonlinear Programs (2009)

Bonami, Pierre, Kilinç, Mustafa, Linderoth, Jeff

This paper provides a survey of recent progress and software for solving mixed integer nonlinear programs (MINLP) wherein the objective and constraints are defined by convex functions and integrality...

Mixed Integer NonLinear Programs featuring “On/Off ” constraints: convex analysis and applications (2009)

Hijazi, Hassan, Bonami, Pierre, Cornuéjols, Gérard, Ouorou, Adam

We call ”on/off” constraint an algebraic constraint that is activated if and only if a corresponding boolean variable is turned ”on” or equal to 1. Our main subject of interest is to derive...

Mixed Integer NonLinear Programs featuring “On/Off ” constraints: convex analysis and applications (2009)

Hijazi, Hassan, Bonami, Pierre, Cornuéjols, Gérard, Ouorou, Adam

We call ”on/off” constraint an algebraic constraint that is activated if and only if a corresponding boolean variable is turned ”on” or equal to 1. Our main subject of interest is to derive...

Projected Chvátal-Gomory cuts for Mixed Integer Linear Programs (2006)

Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi

Recent experiments by Fischetti and Lodi show that the first Chvátal closure of a pure Integer Linear Program (ILP) often gives a surprisingly tight approximation of the integer hull. They optimize...

A Feasibility Pump for Mixed Integer Nonlinear Programs (2006)

Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, François Margot

Abstract We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs...