| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143192 | Operations Research Letters | 2008 | 7 Pages |
Abstract
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also show how earlier results for uncapacitated problems involving (Q,SQ)(Q,SQ) inequalities can be simplified and extended. Finally some limited computational results are presented.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Marco Di Summa, Laurence A. Wolsey,