Pages that link to "Item:Q1662110"

The following pages link to The quadratic minimum spanning tree problem and its variations (Q1662110):

Displaying 5 items.

• 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)
• 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)