1 |
박상혁, 장수영, "후판 날판설계를 위한 이차원 빈패킹 최적화 기법", 대한산업공학회/한국경영과학회 춘계공동학술대회논문집, 2006, pp.1-6.
|
2 |
안혜환, 윤희용, 손재기, 전기만, 양만석, "Bin-Packing과 DRR을 이용한 블루투스 MAC 계층에서의 효과적인 패킷 스케줄링", 한국정보과학회 봄 학술발표논문집, 제30권, 제1호 (2003), pp.451-453.
|
3 |
이영덕, "컨테이너 빈패킹문제의 사례연구", 경영학연구논문집, 제10권, 제1호(2003), pp.17-25.
|
4 |
Arthur, L.C. and L.W. Roger, "A Heuristic for Improved Genetic Bin Packing," Information Processing Letters, 1993.
|
5 |
Eilon, S. and N. Christofides, "The loading problem," Management Science, Vol.17(1971), pp.259-268.
DOI
ScienceOn
|
6 |
Gupta, N., D. Jatinder, and C.H. Johnny, "A new heuristic algorithm for the one-dimensional bin-packing problem," Prodution Planning and Control, Vol.10, No.6(1999), pp.598-603.
DOI
ScienceOn
|
7 |
Johnson, D.S., A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham, "Worst-case performance bounds for simple one-dimensional packing algorithm," SIAM Journal of Computing, Vol.3(1974), pp.299-326.
DOI
|
8 |
Monaci, Michele, and Paolo Toth, "A Set-Covering-Based Heuristic Approach for Bin-Packing Problems," INFORMS Journal on Computing, Vol.18, No.1(2006), pp.71-85.
DOI
ScienceOn
|
9 |
Sami Khuri, and Martin Schutz, "Evolutionary Heuristics for the Bin Packing Problem," The ICANNGA, Springer-Verlag, Vienna (1994), pp.285-288.
|
10 |
Spieksma, F.C.R., "A branch-and-bound algorithm for the two-dimensional vector packing problem," Comput. Oper. Res., Vol.21(1994), pp.19-25.
DOI
ScienceOn
|