Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem.
Dilson Almeida GuimarãesAlexandre Salles da CunhaDilson Lucas PereiraPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- branch and bound algorithm
- semidefinite programming
- lower bound
- semidefinite
- symmetric matrix
- quadratic function
- objective function
- upper bound
- linear programming
- branch and bound
- np hard
- linear matrix inequality
- optimal solution
- primal dual
- kernel matrix
- quadratically constrained quadratic
- max sat
- worst case
- genetic algorithm
- nonlinear programming
- pairwise
- maximum margin
- column generation
- convex optimization
- optimization problems
- haplotype inference