Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2017.11.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2017.11.006 / rank | |||
Normal rank | |||
Latest revision as of 02:09, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partial objective inequalities for the multi-item capacitated lot-sizing problem |
scientific article |
Statements
Partial objective inequalities for the multi-item capacitated lot-sizing problem (English)
0 references
11 July 2018
0 references
mixed-integer programming
0 references
dynamic programming
0 references
cutting planes
0 references
valid inequalities
0 references
partial objective cuts
0 references
\((l, s)\) inequalities
0 references
polyhedral study
0 references
branch-and-cut
0 references
multi-item
0 references
capacitated lot-sizing
0 references
production planning
0 references
0 references
0 references
0 references
