|
Á¦ ¸ñ |
CPLEX MIP Ç®À̼ӵµÀÇ °³¼± ¹æ¹ý |
|
ÀÛ¼ºÀÚ |
À¯È¯ÁÖ |
ÀÛ¼ºÀÏ |
2007-04-11 |
Á¶È¸¼ö |
1156 ȸ |
|
÷ºÎÆÄÀÏ |
÷ºÎµÈ ÆÄÀϾøÀ½.
|
|
MIP Ç®ÀÌ¿¡¼ ¼Óµµ¸¦ °³¼±ÇÏ·Á´Â °æ¿ì, Åë»ó MIPEmphasisÀÇ º¯°æ, Heuristic ÀÛµ¿ÀÇ ¼³Á¤, Àǹ̾ø´Â Cut ÀÛµ¿ÀÇ Á¤Áö, »õ·Î¿î CutÀÇ Ãß°¡¿Í °°Àº ÀÛ¾÷À» ÇÕ´Ï´Ù. ±× ¿ÜÀÇ ½Ãµµ°¡ ÁÁÀº È¿°ú·Î ¿¬°áµÈ ÀûÀº º°·Î ¾ø¾ú´ä´Ï´Ù. . ÀÌ·± Àú·± ¼³Á¤ÀÇ º¯°æÀ¸·Î Àß ¾ÈµÇ¸é, ÀڽŸ¸ÀÇ Å½»öÀ» ¸¸µé¾î º¸¼¼¿ä. ¿¹Á¦°¡ CPLEX Examples¿¡ ÀÖ½À´Ï´Ù. ilogoalex3.cpp¸¦ ÂüÁ¶ÇÏ¸é ±íÀÌ ¿ì¼±Å½»öÀ» ¸¸µé ¼ö ÀÖ½À´Ï´Ù. MIPEmphasis ¼³Á¤ ¹æ¹ý ----------------- cplex.setParam(IloCplex::MIPEmphasis, 0); - 0 Balance optimality and feasibility - 1 Emphasize feasibility over optimality - 2 Emphasize optimality over feasibility - 3 Emphasize moving best bound - 4 Emphasize finding hidden feasible solutions Node Selector ¼³Á¤ ¹æ¹ý --------------- cplex.setParam(IloCplex::NodeSel, 0); - 0 Depth-first search - 1 Best-bound search - 2 Best-estimate search - 3 Alternative best-estimate search |
|
|
|