 |
 |
 |
|
|
|
| HAL: hal-00387116, version 1 |
| DOI: 10.1007/s10107-005-0572-9 |
| Detailed view |  Export this paper |
 |
| Mathematical Programming, Series A (2006) 55-84 |
|
|
|
|
| A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem |
|
|
| Yongpei Guan 1Shabbir Ahmed 2 |
|
|
| (2006-01) |
|
|
|
|
|
|
|
|
|
|
|
| 1: | School of Industrial Engineering [Oklahoma] (IE) |
|
|
|
University of Oklahoma |
|
|
| 2: | School of Industrial and Systems Engineering [Georgia Tech] (ISyE) |
|
|
|
Georgia Institute of Technology (Georgia Tech) |
|
|
| 3: | Institut de Mathématiques de Bordeaux (IMB) |
|
|
|
CNRS : UMR5251 – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II |
|
|
| 4: | RealOpt (INRIA Bordeaux - Sud-Ouest) |
|
|
|
INRIA – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II – CNRS : UMR – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Operations Research |
| hal-00387116, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00387116 | |
| oai:hal.archives-ouvertes.fr:hal-00387116 | |
| From: Andrew J. Miller | |
| Submitted on: Sunday, 24 May 2009 02:09:44 | |
| Updated on: Sunday, 24 May 2009 02:09:44 | |
