Pages that link to "Item:Q2669493"

The following pages link to Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493):

Displaying 2 items.

• Single-item lot-sizing with quantity discount and bounded inventory (Q2670451) (← links)
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs (Q6106968) (← links)