Pages that link to "Item:Q1758285"

The following pages link to Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285):

Displaying 10 items.

• Integrated inventory routing and freight consolidation for perishable goods (Q724138) (← links)
• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← 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)
• The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864) (← links)
• Analysis of a dynamic lot-sizing problem with production capacity constraint (Q2816376) (← links)
• Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
• <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs (Q6072162) (← links)
• Economic lot sizing problem with tank scheduling (Q6167403) (← links)