Wolsey L.A.

L.A. Wolsey

Information about the author L.A. Wolsey will soon be added to the site.
Found 9 papers in total
On unions and dominants of polytopes
On unions and dominants of polytopes
2004
A well-known result on unions of polyhedra in the same space gives an extended...
Tight formulations for some simple mixed integer programs and convex objective integer programs
Tight formulations for some simple mixed integer programs and convex objective integer programs
2003
We study the polyhedral structure of simple mixed integer sets that generalize the two...
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
2003
In this survey we attempt to give a unified presentation of a variety of results on...
On the Wagner–Whitin lot-sizing polyhedron
On the Wagner–Whitin lot-sizing polyhedron
2001
We study a family of unbounded polyhedra arising in the study of uncapacitated...
Dynamic knapsack sets and capacitated lot-sizing
Dynamic knapsack sets and capacitated lot-sizing
2003
A dynamic knapsack set is a natural generalization of the 0–1 knapsack set with...
The uncapacitated lot-sizing problem with sales and safety stocks
The uncapacitated lot-sizing problem with sales and safety stocks
2001
We examine a variant of the uncapacitated lot-sizing model of Wagner–Whitin...
bc-opt: A branch-and-cut code for mixed integer programs
bc-opt: A branch-and-cut code for mixed integer programs
1999
A branch-and-cut mixed integer programming system, called bc-opt, is described,...
The 0–1 knapsack problem with a single continuous variable
The 0–1 knapsack problem with a single continuous variable
1999
Constraints arising in practice often contain many 0–1 variables and one or a...
Valid inequalities for the Lasdon-Terjung production model
Valid inequalities for the Lasdon-Terjung production model
1992
The authors consider a very simple integer program involving production of a single...
Papers per page: