Pages that link to "Item:Q342052"
From MaRDI portal
The following pages link to Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052):
Displaying 9 items.
- 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)
- The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
- A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← 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)
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
- Polyhedral results, branch‐and‐cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem (Q5228505) (← links)
