Pages that link to "Item:Q2450761"
From MaRDI portal
The following pages link to Complete description for the spanning tree problem with one linearised quadratic term (Q2450761):
Displaying 8 items.
- Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← links)
- Matroid optimisation problems with nested non-linear monomials in the objective function (Q1646569) (← 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)
- Multilinear sets with two monomials and cardinality constraints (Q2097167) (← links)
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem (Q2272297) (← links)
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs (Q5232142) (← links)
