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):
Displaying 15 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)
- An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs (Q1888151) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (Q2496059) (← links)
- Fast algorithms for convex cost flow problems on circles, lines, and trees (Q2811315) (← links)
- Analysis of a dynamic lot-sizing problem with production capacity constraint (Q2816376) (← links)
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing (Q3703618) (← links)
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time (Q3985143) (← links)
- Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints (Q3986754) (← links)
- The dynamic lot-sizing problem with variable unit costs (Q4851980) (← links)
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
