An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
From MaRDI portal
Publication:1888151
DOI10.1023/B:COAP.0000033966.31088.98zbMath1084.90010MaRDI QIDQ1888151
Joaquín Sicilia, Antonio Sedeño-Noda, José Miguel Gutiérrez, Beatriz Abdul-Jalbar
Publication date: 22 November 2004
Published in: Computational Optimization and Applications (Search for Journal in Brave)
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
90B05: Inventory, storage, reservoirs
90C39: Dynamic programming
Related Items
Capacitated lot sizing problems with inventory bounds, Single-item dynamic lot-sizing problems: an updated survey, Multi-item uncapacitated lot sizing problem with inventory bounds, An efficient approach for solving the lot-sizing problem with time-varying storage capacities