Add to ORKGIn 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
We develop a method for computing facet-defining valid inequalities for any mixed-integer set PJ. Wh...
We examine the single-item lot-sizing problem with Wagner-Whitin costs over an n period horizon, i.e...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...
In this study, we investigate two-period subproblems proposed by Akartunali et al. (2014). In partic...
In this paper, we study two-period subproblems proposed by Akartunali et al. (2015) for lot-sizing p...
In this paper, we investigate two-period subproblems for big-bucket lot-sizing problems, which have ...
The multi-item Capacitated Lot-sizing problem with Setup Times (CLST) is an important problem from b...
Despite the significant attention they have drawn, big bucket lot-sizing problems remain notoriously...
We study the big-bucket capacitated lot sizing problem with setup times. We use the novel methodolog...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
Despite the significant attention that they have drawn over the years, big bucket lot-sizing problem...
We consider several variants of the two-level lot-sizing problem with one item at the upper level fa...
We consider several variants of the two-level lot-sizing problem with one item at the upper level fa...
We present and study a mixed integer programming model that arises as a substructure in many industr...
A capacitated multi-stage lot-sizing problem for general product structures with setup and lead time...
We develop a method for computing facet-defining valid inequalities for any mixed-integer set PJ. Wh...
We examine the single-item lot-sizing problem with Wagner-Whitin costs over an n period horizon, i.e...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...
In this study, we investigate two-period subproblems proposed by Akartunali et al. (2014). In partic...
In this paper, we study two-period subproblems proposed by Akartunali et al. (2015) for lot-sizing p...
In this paper, we investigate two-period subproblems for big-bucket lot-sizing problems, which have ...
The multi-item Capacitated Lot-sizing problem with Setup Times (CLST) is an important problem from b...
Despite the significant attention they have drawn, big bucket lot-sizing problems remain notoriously...
We study the big-bucket capacitated lot sizing problem with setup times. We use the novel methodolog...
The lot-sizing polytope is a fundamental structure contained in many practical production planning p...
Despite the significant attention that they have drawn over the years, big bucket lot-sizing problem...
We consider several variants of the two-level lot-sizing problem with one item at the upper level fa...
We consider several variants of the two-level lot-sizing problem with one item at the upper level fa...
We present and study a mixed integer programming model that arises as a substructure in many industr...
A capacitated multi-stage lot-sizing problem for general product structures with setup and lead time...
We develop a method for computing facet-defining valid inequalities for any mixed-integer set PJ. Wh...
We examine the single-item lot-sizing problem with Wagner-Whitin costs over an n period horizon, i.e...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...