Pages that link to "Item:Q5228505"

The following pages link to Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem (Q5228505):

Displaying 5 items.

• Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
• Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← links)
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← 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)