Cited in
(6)- A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
- The profit maximizing capacitated lot-size (PCLSP) problem
- A branch and bound method for stochastic integer problems under probabilistic constraints
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
- bc-prod
- The single (and multi) item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up
This page was built for software: LOTSIZELIB