The authors formulate the capacitated single-item lot-sizing problem as a global constraint that achieves bound consistency in pseudo-polynomial time via time decomposition and DP-based filtering.
Encod- ings of the sequence constraint
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A global constraint for the capacitated single-item lot-sizing problem
The authors formulate the capacitated single-item lot-sizing problem as a global constraint that achieves bound consistency in pseudo-polynomial time via time decomposition and DP-based filtering.