.png){kind=icon}
.png){kind=icon}
Return
Spanning and Splitting: Integer Semidefinite Programming for the Quadratic Minimum Spanning Tree Problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2025.10.051.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Spanning trees in graphs are characterized by a compact linear matrix inequality • The quadratic minimum spanning tree problem can be modelled as an integer SDP • Our new doubly nonnegative relaxation provides strong bounds for the QMSTP. • The Peaceman-Rachford splitting method can handle a large amount of polyhedral cuts
Keywords:
Combinatorial Optimization
Spanning Trees
Integer Semidefinite Programming
Algebraic Connectivity
Projection Methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations