Spanning and splitting: Integer semidefinite programming for the quadratic minimum spanning tree problem
Open Access
- 5 November 2025
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 331 (2) , 381-395
Abstract
No abstract availableAll Related Versions
Funding Information
- Austrian Science Fund
This publication has 33 references indexed in Scilit:
- The Chvátal–Gomory procedure for integer SDPs with applications in combinatorial optimizationMathematical Programming, 2024
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programsMathematical Programming, 2022
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problemComputational Optimization and Applications, 2021
- Fast projection onto the simplex and the $\pmb {l}_\mathbf {1}$ l 1 ballMathematical Programming, 2015
- Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problemNetworks, 2015
- Alternating direction augmented Lagrangian methods for semidefinite programmingMathematical Programming Computation, 2010
- Cuts for mixed 0-1 conic programmingMathematical Programming, 2005
- The quadratic minimum spanning tree problemNaval Research Logistics (NRL), 1992
- Ordering trees by algebraic connectivityGraphs and Combinatorics, 1990
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957