Pages that link to "Item:Q288224"
From MaRDI portal
The following pages link to Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224):
Displaying 5 items.
- 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)
- Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost (Q2201355) (← links)
- Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)
- Learning optimal solutions via an LSTM-optimization framework (Q6168346) (← links)