#### Filter Results:

- Full text PDF available (111)

#### Publication Year

1978

2017

- This year (6)
- Last 5 years (26)
- Last 10 years (66)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Egon Balas, Sebastián Ceria, Gérard Cornuéjols
- Math. Program.
- 1993

We propose a cutting plane algorithm for mixed 0-1 programs based on a family of polyhedra which strengthen the usual LP relaxation. We show how to generate a facet of a polyhedron in this family… (More)

- Pierre Bonami, Lorenz T. Biegler, +8 authors Andreas Wächter
- Discrete Optimization
- 2008

This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software for solving… (More)

- Gérard Cornuéjols, Jean Fonlupt, Denis Naddef
- Math. Program.
- 1985

- Valentin Borozan, Gérard Cornuéjols
- Math. Oper. Res.
- 2009

In this paper we consider a semi-infinite relaxation of mixed integer linear programs. We show that minimal valid inequalities for this relaxation correspond to maximal latticefree convex sets, and… (More)

1 Preface The integer programming models known as set packing and set covering have a wide range of applications, such as pattern recognition, plant location and airline crew scheduling. Sometimes,… (More)

- Michele Conforti, Gérard Cornuéjols
- Discrete Applied Mathematics
- 1984

For the problem max{Z(S): S is an independent set in the matroid X}, it is well-known that the greedy algorithm finds an optimal solution when Z is an additive set function (RadoEdmonds theorem).… (More)

- Gérard Cornuéjols, François Margot
- LATIN
- 2008

In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete… (More)

- Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj
- Oper. Res. Lett.
- 1996

In this paper, we investigate the use of Gomory's mixed integer cuts within a branch-and-cut framework. It has been argued in the literature that \a marriage of classical cutting planes and tree… (More)

- Gérard Cornuéjols, Milind Dawande
- IPCO
- 1998

In this paper, we consider a class of 0–1 programs which, although innocent looking, is a challenge for existing solution methods. Solving even small instances from this class is extremely difficult… (More)

- Gérard Cornuéjols, William H. Cunningham
- Discrete Mathematics
- 1985

In this paper we introduce a new graph composition, called 2-amalgam, and we prove that the 2-amalgam of perfect graphs is perfect. This composition generalizes many of the operations known to… (More)