An FPTAS for SM‐CELS problem with monotone cost functions
From MaRDI portal
Publication:3579135
DOI10.1108/03684920910994105zbMath1192.90013OpenAlexW2018893364MaRDI QIDQ3579135
Qingguo Bai, Jianteng Xu, Qing-Pu Zhang
Publication date: 5 August 2010
Published in: Kybernetes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/03684920910994105
Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)
Related Items (1)
Cites Work
- Inventory replenishment model: lot sizing versus just-in-time delivery.
- Improving the complexities of approximation algorithms for optimization problems
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- Deterministic Production Planning: Algorithms and Complexity
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
This page was built for publication: An FPTAS for SM‐CELS problem with monotone cost functions