Local Cuts and Two-Period Convex Hull Closures for Big Bucket Lot-Sizing Problems.
MILLER, Andrew J.
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
MILLER, Andrew J.
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
< Leer menos
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Idioma
en
Communication dans un congrès
Este ítem está publicado en
ROADEF 2010: 11e congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF 2010: 11e congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF 2010: 11e congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, 2010-02. 2010p. http://spiderman-2.laas.fr/roadef2010/actes/
Resumen en inglés
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 ...Leer más >
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.< Leer menos
Orígen
Importado de HalCentros de investigación