Pages that link to "Item:Q2272297"

The following pages link to Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297):

Displaying 10 items.

• Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
• Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
• Solving the quadratic minimum spanning tree problem (Q387698) (← links)
• Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
• Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061) (← links)
• A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
• On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
• A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
• Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem (Q5228505) (← links)
• Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system (Q6668153) (← links)