´Ü¾î | |
---|---|
MINTO | |
¼³¸í | MINTO´Â ºÐ±âÇÑÁ¤¹ý(branch and bound) ¾Ë°í¸®ÁòÀ» »ç¿ëÇÏ´Â Á¤¼ö °èȹ¹ý(integer programming) ÇØ°áÀÚ(solver)·Î¼, À̴ ȥÇÕµÈ Á¤¼ö ¿ÉƼ¸¶ÀÌÀú(Mixed Integer Optimizer)¸¦ ³ªÅ¸³½´Ù. MINTO´Â ¼±Çü ¿ÏÈ(linear programming relaxation)¿Í ºÐ±âÇÑÁ¤¹ýÀ¸·Î È¥ÇÕµÈ Á¤¼ö °èȹ¹ý ¹®Á¦¸¦ ÇØ°áÇÏ´Â ¼ÒÇÁÆ®¿þ¾î ½Ã½ºÅÛÀÌ´Ù. ÀÌ´Â ÀÚµ¿ Á¦¾à ºÐ·ù(automatic constraint classification), Àüó¸®(preprocessing), ÃʱâÀÇ ÈÞ¸®½ºÆ½(primal heuristics), Á¦¾à »ý¼º(constraint generation)À» Á¦°øÇÑ´Ù. »ç¿ëÀÚ´Â ¹®Á¦ ºÐ·ù¿¡ ´ëÇÏ¿© Á» ´õ ³ôÀº È¿À²À» ÀÌ·ç±â À§ÇØ MINTO¸¦ Ä¿½ºÅ͸¶ÀÌÁî ÇÒ ¼ö ÀÖ´Â ´Ù¾çÇÑ Æ¯¼ºÈµÈ ÀÀ¿ë ·çƾÀ» Á¦°øÇÏ´Â °ÍÀ¸·Î ±âº»ÀûÀÎ ¾Ë°í¸®ÁòÀ» dzºÎÇÏ°Ô ÇÒ ¼ö ÀÖ´Ù. |
Copyright(c) Computer Science Engineering Research Information Center. All rights reserved.