Pages that link to "Item:Q1785380"
From MaRDI portal
The following pages link to A polynomial time algorithm for convex cost lot-sizing problems (Q1785380):
Displaying 7 items.
- Lot-sizing polyhedra with a cardinality constraint (Q1198618) (← links)
- A polynomial time algorithm for unloading boxes off a gravity conveyor (Q1799383) (← links)
- Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648) (← links)
- Lot-sizing with fixed charges on stocks: the convex hull (Q2386201) (← links)
- A dynamic programming approach for a class of robust optimization problems (Q2817842) (← links)
- A polynomial-time algorithm for the economic lot-size problem with multiple suppliers and multiple retailers (Q2917961) (← links)
- Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems (Q3392239) (← links)