Pages that link to "Item:Q2272297"
From MaRDI portal
The following pages link to Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297):
Displaying 3 items.
- Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
- Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system (Q6668153) (← links)
