Author:
Lin Wenshui,Xu Jinping,Wang Jiandong,Wu Xinyou
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Coffman Jr., E., Garey, M., Johnson, D.: An application of bin packing to multiprocessor scheduling. SIAM Journal on Computing 7(1), 1–17 (1978)
2. Coffman, E., Garey, M., Johason, D.: Approximation algorithms for bin packing problems – An update survey. In: Ausiello, G., Lucertini, M., Serafini, P. (eds.) Algorithm Design for Computer System Design, pp. 49–106. Springer, New York (1984)
3. Coffman Jr., E., Leighton, F.: A provably efficient algorithm for dynamic storage allocation. Journal of Computer and System Sciences 38(1), 2–35 (1989)
4. Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research 44(2), 145–159 (1990)
5. Paull, A.: Linear programming: A key to optimum newsprint production. Pulp Paper Magazine of Canada 57, 85–90 (1956)