• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Current Result Document : 1 / 1

ÇѱÛÁ¦¸ñ(Korean Title) Ȧ¦¼º Á¦¾àÀÌ ÀÖ´Â k-¼¾ÅÍ ¹× ¼³ºñ À§Ä¡ ¼±Á¤ ¹®Á¦¿¡ ´ëÇÑ ¾Ë°í¸®ÁòÀÇ È¿À²ÀûÀÌ°í °­°ÇÇÑ ±¸Çö
¿µ¹®Á¦¸ñ(English Title) Efficient and Robust Implementation of the Algorithms for Parity-Constrained k-Center and Facility Location
ÀúÀÚ(Author) ±è°­»ê   ¾ÈÇüÂù   Kangsan Kim   Hyung-Chan An  
¿ø¹®¼ö·Ïó(Citation) VOL 48 NO. 03 PP. 0264 ~ 0274 (2021. 03)
Çѱ۳»¿ë
(Korean Abstract)
º» ³í¹®¿¡¼­´Â Ȧ¦¼º Á¦¾àÀÌ ÀÖ´Â k-¼¾ÅÍ ¹× ¼³ºñ À§Ä¡ ¼±Á¤ ¹®Á¦¿¡ ´ëÇÑ Á¤È®ÇÑ ¾Ë°í¸®Áò°ú ±Ù»ç ¾Ë°í¸®ÁòÀ» °³¼±Çϱâ À§ÇÑ ÈÞ¸®½ºÆ½À» Á¦¾ÈÇÏ°í, À̵éÀ» ½ÇÇèÀûÀ¸·Î Æò°¡ÇÑ´Ù. ÀÌµé µÎ ¹®Á¦´Â ÀÌ·ÐÀû ÀÎ ¸é¿¡¼­»Ó¸¸ ¾Æ´Ï¶ó ½Ç¿ëÀûÀ¸·Îµµ Áß¿äÇÑ ¹®Á¦·Î¼­, »ó¼ö ÀÎÀÚ ±Ù»ç ¾Ë°í¸®ÁòÀÌ ¾Ë·ÁÁ® ÀÖ´Ù. ±×·¯³ª ½ÇÁ¦·Î ÀÌµé ¹®Á¦¿¡ ´ëÇÑ ÃÖÀûÇØ È¤Àº ±Ù»çÇظ¦ ã´Â, ½Ç¿ëÀûÀ¸·Î ÀûÇÕÇÑ ±¸ÇöÀ» ¾ò±â À§ÇÑ ¿¬±¸´Â °ÅÀÇ ÀÌ·ç¾îÁöÁö ¸øÇÏ¿´´Ù. º» ³í¹®¿¡¼­´Â À̸¦ º¸¿ÏÇϱâ À§ÇØ ¾Ë°í¸®ÁòÀÇ ¼öÇà ¼Óµµ, ÇØÀÇ Áú, ¼öÄ¡ ¿¡·¯¸¦ °³¼±ÇÏ´Â ÈÞ¸®½ºÆ½À» ¼³°èÇÏ°í ½ÇÁ¦ µ¥ÀÌÅͼ¿¡¼­ÀÇ ¼º´ÉÀ» ÃøÁ¤ÇÑ´Ù. ÀÌ¿Ü¿¡µµ, ±âÁ¸¿¡ ¾Ë·ÁÁø »ó¼ö ÀÎÀÚ ±Ù»ç ¾Ë°í¸®ÁòÀÌ Á¤È®ÇÑ ¾Ë°í¸®Áò¿¡ ºñÇØ ¼º´É¿¡ ÀÖ¾î ¾î¶°ÇÑ Â÷À̸¦ º¸ÀÌ´ÂÁö °ËÁõÇÑ´Ù.
¿µ¹®³»¿ë
(English Abstract)
In this paper, we present heuristics for improving the exact and approximation algorithms for parity-constrained k-center and facility location problems, along with their computational evaluations. For the theoretical and practical relevance of these problems, constant-factor approximation algorithms are known for both problems. Unfortunately, few studies have been conducted to obtain a practically adequate implementation of exact and/or approximation algorithms for either problem. This paper fills in this gap by devising heuristics to improve the running time, solution quality, and numerical errors of the algorithms for both problems and measuring their performance. We also evaluate the known constant-factor approximation algorithms in comparison to exact algorithms
Å°¿öµå(Keyword) Ȧ¦¼º Á¦¾à   k-¼¾ÅÍ ¹®Á¦   ¼³ºñ À§Ä¡ ¼±Á¤ ¹®Á¦   Á¶ÇÕ ÃÖÀûÈ­ ¾Ë°í¸®Áò   ±Ù»ç ¾Ë°í¸®Áò   ÈÞ¸®½ºÆ½   parity constraints   k-center problem   facility location   combinatorial optimization algorithms   approximation algorithms   heuristics  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå