Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
From MaRDI portal
(Redirected from Publication:2355847)
Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs''
Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs''
Cited in
(5)- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Improved algorithms for dynamic lot sizing problems with incremental discount
- A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
- Lot sizing with piecewise concave production costs
This page was built for publication: Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355847)
