Pages that link to "Item:Q2940066"

The following pages link to Lot Sizing with Piecewise Concave Production Costs (Q2940066):

Displaying 12 items.

• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
• NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
• Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
• Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty (Q2160510) (← links)
• Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
• Single-item lot-sizing with quantity discount and bounded inventory (Q2670451) (← links)
• Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
• Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
• Combined replenishment and warehousing with contract commitments and flexibilities (Q6053128) (← links)
• <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs (Q6072162) (← links)
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs (Q6106968) (← links)