Local Cuts and Two-Period Convex Hull Closures for Big Bucket Lot-Sizing Problems.
Abstract
Despite the significant attention that they have drawn over the years, big bucket lot-sizing problems remain notoriously difficult to solve. The authors have previously presented evidence that what make these problems difficult are the embedded single-machine, single-level, multi-period submodels. We therefore consider the simplest such submodel, a multi-item, two-period capacitated model.
Domains
Operations Research [math.OC]
Origin : Files produced by the author(s)
Loading...