#### Filter Results:

- Full text PDF available (75)

#### Publication Year

1971

2017

- This year (3)
- Last 5 years (21)
- Last 10 years (53)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher
- Math. Program.
- 1978

Let N be a finite set and z be a real-valued function defined on the set of subsets of N that satisfies z(S)+z(T)>-z(SUT)+z(SnT) for all S, T in N. Such a function is called submodular. We consider the problem maXscN {z(S): IS[ <-K, z(S) submodular}. Several hard combinatorial optimization problems can be posed in this framework. For example, the problem of… (More)

- George L. Nemhauser, Laurence A. Wolsey
- Wiley interscience series in discrete mathematics…
- 1988

- Laurence A. Wolsey
- Wiley Encyclopedia of Computer Science and…
- 2008

- Laurence A. Wolsey
- Combinatorica
- 1982

In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice point free bodies and the derivation of inequalities for mixed integer linear programs by considering two rows of a simplex tableau simultaneously.

- Laurence A. Wolsey
- Math. Program.
- 1975

- Hugues Marchand, Laurence A. Wolsey
- Math. Program.
- 1999

Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing knapsack separation routines cannot be used on such constraints. Here we study such constraint sets, and derive valid inequalities that can be used as cuts for such sets, as well for more general mixed 0-1 constraints. Specifically we… (More)

- George L. Nemhauser, Laurence A. Wolsey
- Math. Oper. Res.
- 1978

- George L. Nemhauser, Laurence A. Wolsey
- Math. Program.
- 1990

- Hugues Marchand, Laurence A. Wolsey
- Operations Research
- 2001

A separation heuristic for mixed integer programs is presented that theoretically allows one to derive several families of \strong" valid inequalities for speciic models and computationally gives results as good as or better than those obtained from several existing separation routines including ow cover and integer cover inequalities. The heuristic is… (More)