Pages that link to "Item:Q613509"
From MaRDI portal
The following pages link to Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509):
Displaying 5 items.
- LQ optimal sliding mode control of periodic review perishable inventories with transportation losses (Q459778) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (Q1762169) (← links)
- A polynomial time algorithm for convex cost lot-sizing problems (Q1785380) (← links)
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
