Pages that link to "Item:Q2514883"
From MaRDI portal
The following pages link to Polynomial cases of the economic lot sizing problem with cost discounts (Q2514883):
Displaying 10 items.
- Integrated inventory routing and freight consolidation for perishable goods (Q724138) (← 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)
- Joint optimization of dynamic lot and warehouse sizing problems (Q1754258) (← links)
- Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
- Transportation mode selection in inventory models: a literature review (Q2001452) (← links)
- Lot Sizing with Piecewise Concave Production Costs (Q2940066) (← links)
- Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
- Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
- <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs (Q6072162) (← links)
