Pages that link to "Item:Q387698"
From MaRDI portal
The following pages link to Solving the quadratic minimum spanning tree problem (Q387698):
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)
- Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← 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)
- 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)
- Complete description for the spanning tree problem with one linearised quadratic term (Q2450761) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
