arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.04273cond-mat.dis-nncond-mat.stat-mechcs.ITmath.IT
收藏

组合优化问题线性规划松弛的统计力学分析

Statistical-mechanical Analysis of Linear Programming Relaxation for Combinatorial Optimization Problems

Satoshi Takabe, Koji Hukushima

摘要:

将线性规划(LP)问题作为一类整数规划(IP)问题的最小顶点覆盖的松弛问题来研究。提出了一种基于$α$ -一致超边的Erdös-Rényi随机图的格子气模型,用于表示一般单参数物理力学模型中最小VC的LP和IP问题.统计力学分析表明,对于$α=2$,LP最佳解通常等于热力学极限中临界平均度$c=e$以下的IP给出的解。该临界阈值推广了数学结果$c=1$,并与IP的复本对称性破缺阈值相一致。还研究了$α\geq 3$($α$ -均匀随机图上的最小顶点覆盖)的最小碰集的LP松弛。分析和数值结果强烈表明,LP松弛未能估计最佳值以上的临界平均度$c=e/(α-1)$的副本对称性被打破。

英文摘要:

Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover, a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of $α$-uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical-mechanical model with a one-parameter family. Statistical-mechanical analyses reveal for $α=2$ that the LP optimal solution is typically equal to that given by the IP below the critical average degree $c=e$ in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result $c=1$, and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with $α\geq 3$, minimum vertex covers on $α$-uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree $c=e/(α-1)$ where the replica symmetry is broken.

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

↑