.png){kind=icon}
返回
A continuous nonlinear optimization perspective on the Spin Glass Problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.physa.2026.131356.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
• The paper builds on Rosenberg’s classical result for multilinear optimization over box constraints and applies it to the Spin Glass Problem (SGP), showing that the continuous relaxation can be used (together with a simple problem-specific argument) to recover optimal discrete spin configurations. • The proposed continuous formulation, solved with a modern global optimization solver, attains high-quality solutions on standard benchmark instances and often matches or surpasses the best results obtained by recent integer programming linearization techniques.
Keyword:
Spin Glass Problem
Max cut problem
Continuous optimization
Integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
P
IF:
3.1
论文数:
1.3K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
查看更多内容