#### Filter Results:

- Full text PDF available (82)

#### Publication Year

1971

2017

- This year (3)
- Last 5 years (20)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

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

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

- Laurence A. Wolsey
- Combinatorica
- 1982

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

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

- Martin E. Dyer, Laurence A. Wolsey
- Discrete Applied Mathematics
- 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 specific models and computationally gives results as good as or better than those obtained from several existing separation routines including flow cover and integer cover inequalities. The heuristic is… (More)

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

- Tony J. Van Roy, Laurence A. Wolsey
- Discrete Applied Mathematics
- 1986

l ; ~ x ; ~ l . l j , j ~ . M I , I]yj<-xj<-u~yj, j~M2, yje {o, 1}, jeM2UM3. where x~, yj are variables, aj, bj, d, l], u~ are constants, and M1, M2, M3 are sets (M2 • p t / ~ t and M3 need not be disjoint)• The constraints xj_ u.i, xj_ ujyi are called simple and variable (VUB) upper bound constraints respectively, and lower bound constraints are defined… (More)