Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
暂无分享,去创建一个
Chengbin Chu | Rémy La | C. Chu | Rémy La
[1] Edward G. Coffman,et al. Stochastic analysis of a slotted FIFO communication channel , 1993, IEEE Trans. Inf. Theory.
[2] Weizhen Mao,et al. Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing , 1993, SIAM J. Comput..
[3] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .
[4] Andrew Chi-Chih Yao,et al. Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.
[5] David S. Johnson,et al. Bin packing with discrete item sizes, part II: tight bounds on first fit , 1997 .
[6] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..
[7] Chengbin Chu,et al. The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming , 1999, Eur. J. Oper. Res..
[8] D. Simchi-Levi. New worst‐case results for the bin‐packing problem , 1994 .
[9] D. K. Friesen,et al. Variable Sized Bin Packing , 1986, SIAM J. Comput..
[10] Frank D. Murgolo. An Efficient Approximation Scheme for Variable-Sized Bin Packing , 1987, SIAM J. Comput..
[11] D. T. Lee,et al. A simple on-line bin-packing algorithm , 1985, JACM.