Pages that link to "Item:Q3392169"
From MaRDI portal
The following pages link to TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in <i>O</i>(<i>n</i> log <i>n</i>) Time (Q3392169):
Displayed 7 items.
- Dynamic lot sizing for multiple products with a new joint replenishment model (Q418100) (← links)
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← links)
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
- A robust lot sizing problem with ill-known demands (Q690887) (← links)
- The stochastic lot-sizing problem with quantity discounts (Q1652181) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)