Pages that link to "Item:Q3120555"
From MaRDI portal
The following pages link to Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging (Q3120555):
Displaying 22 items.
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- The economic lot-sizing problem with perishable items and consumption order preference (Q319481) (← links)
- Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds (Q507343) (← links)
- Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
- Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities'' (Q545126) (← links)
- A polynomial algorithm for the production/ordering planning problem with limited storage (Q856668) (← links)
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (Q943783) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Joint optimization of dynamic lot and warehouse sizing problems (Q1754258) (← links)
- Two-level lot-sizing with inventory bounds (Q1756341) (← links)
- A note on ``The economic lot sizing problem with inventory bounds'' (Q1927015) (← links)
- Multi-item uncapacitated lot sizing problem with inventory bounds (Q2257083) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity (Q2294332) (← links)
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity (Q2494508) (← links)
- Dynamic lot-sizing model under perishability, substitution, and limited storage capacity (Q2664318) (← links)
- A backward recursive algorithm for inventory lot-size models with power-form demand and shortages (Q3437436) (← links)
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865) (← links)
- Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
- Solving the capacitated lot-sizing problem with backorder consideration (Q4658483) (← links)
- Combined replenishment and warehousing with contract commitments and flexibilities (Q6053128) (← links)