Pages that link to "Item:Q288224"

The following pages link to Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224):

Displaying 9 items.

• An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← links)
• Dynamic knapsack sets and capacitated lot-sizing (Q1411629) (← links)
• Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
• New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups (Q2140335) (← links)
• An application of dynamic programming to assign pressing tanks at wineries (Q2189941) (← links)
• Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost (Q2201355) (← links)
• An <i>O</i>(<i>T</i>²) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem (Q3821896) (← links)
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)
• Learning optimal solutions via an LSTM-optimization framework (Q6168346) (← links)