Models and methods for capacitated lot-sizing problems

DOI10.1007/s10288-007-0062-4zbMath1165.90431OpenAlexW2021220631MaRDI QIDQ1029562

Nabil Absi

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Production models (90B30) Combinatorial optimization (90C27) Dynamic programming (90C39)

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

This page was built for publication: Models and methods for capacitated lot-sizing problems