#### Filter Results:

- Full text PDF available (48)

#### Publication Year

1977

2019

- This year (5)
- Last 5 years (30)
- Last 10 years (71)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn 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)

- 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)

This chapter is based on two sources, namely, the survey by Cornuejols, Nemhauser and Wolsey 5, Chapter 3], and a recent paper by Aardal, Shmoys and Tardos 9]. The book by Nemhauser and Wolsey 6] has… (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)

- 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)

- Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic
- Combinatorica
- 2005

A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we give an algorithm to test if a graph G is Berge, with running time O(|V… (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)

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

Practical exercise 3 The goal in this exercise is to detect arbitrage opportuniti es using the modelling language ZIMPL. Suppose we are given a set I of assets, a set J of scenarios, a vector S0 of… (More)