Pages that link to "Item:Q5322130"
From MaRDI portal
The following pages link to Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation (Q5322130):
Displayed 13 items.
- The economic lot-sizing problem with perishable items and consumption order preference (Q319481) (← links)
- A column generation-based heuristic algorithm for an inventory routing problem with perishable goods (Q375988) (← links)
- Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (Q943783) (← links)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
- Four equivalent lot-sizing models (Q1003497) (← links)
- Multi-item uncapacitated lot sizing problem with inventory bounds (Q2257083) (← links)
- Minimum concave cost flow over a grid network (Q2340279) (← links)
- A linear-time algorithm for finding optimal vehicle refueling policies (Q2467464) (← links)
- On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid (Q2828332) (← links)
- Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
- Finding Optimal Refueling Policies in Transportation Networks (Q3511436) (← links)