A theoretical and computational study of two-period relaxations for lot-sizing problems with big bucket capacities

Doostmohammadi, Mahdi and Akartunali, Kerem (2014) A theoretical and computational study of two-period relaxations for lot-sizing problems with big bucket capacities. In: International Workshop on Lot-Sizing (IWLS) 2014, 2014-08-27 - 2014-08-29.

Full text not available in this repository.Request a copy

Abstract

In this study, we investigate two-period subproblems proposed by Akartunali et al. (2014). In particular, we study the polyhedral structure of the mixed integer sets related to various two-period relaxations. We derive several families of valid inequalities and investigate their facet-defining conditions. Then we discuss the separation problems associated with these valid inequalities. Finally we investigate the computational strength of these cuts when they are included in a branch-and-cut framework to reduce the integrality gap of the big bucket lot-sizing problems.

ORCID iDs

Doostmohammadi, Mahdi ORCID logoORCID: https://orcid.org/0000-0002-6865-8058 and Akartunali, Kerem ORCID logoORCID: https://orcid.org/0000-0003-0169-3833;
CORE (COnnecting REpositories)