Pages that link to "Item:Q583078"

The following pages link to A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078):

Displaying 7 items.

• A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
• A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem (Q1734824) (← 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)
• A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)