arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1505.03068math.OC
收藏

用模拟退火法求解最大割问题

Solving maximum cut problems by simulated annealing

Tor G. J. Myklebust

摘要:

本文给出了一个简单的实现模拟退火解决最大割问题,并比较其性能的一些现有的启发式求解器。所使用的公式是经典的,可以追溯到1989年约翰逊,阿拉贡,麦吉奥赫和舍文的论文。这种实现方式没有使用最大割问题特有的结构,但其较低的每次迭代成本使其能够在几分钟的计算时间内找到比先前已知的89个标准最大割实例中的40个更好的解决方案。

英文摘要:

This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compares its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, McGeoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but its low per-iteration cost allows it to find better solutions than were previously known for 40 of the 89 standard maximum cut instances tested within a few minutes of computation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑