An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
暂无分享,去创建一个
[1] Gabriel R. Bitran,et al. Approximation Methods for the Uncapacitated Dynamic Lot Size Problem , 1984 .
[2] G. Bitran,et al. Computational Complexity of the Capacitated Lot Size Problem , 1982 .
[3] Gerhard J. Woeginger,et al. When does a dynamic programming formulation guarantee the existence of an FPTAS? , 1999, SODA '99.
[4] J. K. Lenstra,et al. Deterministic Production Planning: Algorithms and Complexity , 1980 .
[5] S. Axsäter. Note-Performance Bounds for Lot Sizing Heuristics , 1985 .
[6] Gabriel R. Bitran,et al. Approximation Formulations for the Single-Product Capacitated Lot Size Problem , 1986, Oper. Res..
[7] Gerhard J. Woeginger,et al. When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? , 2000, INFORMS J. Comput..
[8] M. Y. Kovalyov. Improving the complexities of approximation algorithms for optimization problems , 1995, Oper. Res. Lett..
[9] Albert P. M. Wagelmans,et al. Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems , 2001, Math. Oper. Res..