Models and methods for capacitated lot-sizing problems
From MaRDI portal
Publication:1029562
DOI10.1007/s10288-007-0062-4zbMath1165.90431MaRDI QIDQ1029562
Publication date: 13 July 2009
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-007-0062-4
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B30: Production models
90C27: Combinatorial optimization
90C39: Dynamic programming
Cites Work
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- The 0-1 knapsack problem with a single continuous variable
- On the polyhedral structure of a multi-item production planning model with setup times
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs