Pages that link to "Item:Q1662110"
From MaRDI portal
The following pages link to The quadratic minimum spanning tree problem and its variations (Q1662110):
Displaying 11 items.
- On a quadratic programming problem involving distances in trees (Q338937) (← links)
- Solving the quadratic minimum spanning tree problem (Q387698) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Fuzzy quadratic minimum spanning tree problem (Q556109) (← links)
- A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
- Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061) (← links)
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
- The quadratic minimum spanning tree problem (Q3989988) (← links)
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem (Q5228505) (← links)
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs (Q6087142) (← links)
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898) (← links)