´Ü¾î | |
---|---|
Bin packing problem | |
¼³¸í | °è»ê º¹Àâµµ ÀÌ·Ð(computational complexity theory)¿¡¼ bin packing problem´Â Á¶ÇÕ NP-hard ¹®Á¦ÀÌ´Ù. »ç¿ëµÇ´Â binÀ» ÃÖ¼ÒÈÇÏ´Â ¹æÇâÀ¸·Î, ´Ù¾çÇÑ ºÎÇÇÀÇ ¹°Ã¼¸¦ ¿ë·®(capacity) V¸¦ °®´Â À¯ÇÑ °³ÀÇ bin¾È¿¡ ä¿ö¾ß¸¸ ÇÑ´Ù. ÄÁÅ×À̳ʸ¦ ä¿ì±â, Áß·®(weight capacity)À» °®´Â Æ®·°¿¡ ¼±ÀûÇϱâ, Á¦°Å°¡ °¡´ÉÇÑ (removable) ¸Åü¿¡ ÆÄÀÏ ¹é¾÷ »ý¼ºÇϱ⠵î°ú °°ÀÌ ÀÌ ¹®Á¦(2D packing, ¼±Çü packing, Áß·®¿¡ ÀÇÇÑ packing, ºñ¿ë¿¡ ÀÇÇÑ packing)¿¡ ´ëÇÑ ¸¹Àº ÀÀ¿ëÀÌ Á¸ÀçÇÑ´Ù. |
Copyright(c) Computer Science Engineering Research Information Center. All rights reserved.