Name
Abstract | ||
|---|---|---|
•We study the single-level multi-item capacitated lot-sizing problem (MCLSP).•We propose partial objective inequalities to strengthen the MCLSP MIP formulation.•These inequalities are strengthened by lifting and back-lifting strategies.•A separation routine that employs these cuts in a cut-and-branch scheme is given.•Computational results show substantial improvements in solving the MCLSP. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.cor.2017.11.006 | Computers & Operations Research |
Keywords | Field | DocType |
Mixed-integer programming,Dynamic programming,Cutting planes,Valid inequalities,Partial objective cuts,(l, S) inequalities,Polyhedral study,Branch-and-cut,Multi-item,Capacitated lot-sizing,Production planning | Dynamic programming,Mathematical optimization,Time horizon,Programming paradigm,Inequality,Integer programming,Polytope,Sizing,Mathematics | Journal |
Volume | Issue | ISSN |
91 | C | 0305-0548 |
Citations | PageRank | References |
0 | 0.34 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| İ. Esra Büyüktahtakın | 1 | 25 | 5.03 |
| J. Cole Smith | 2 | 610 | 43.34 |
| Joseph C. Hartman | 3 | 40 | 5.47 |