Complete description for the spanning tree problem with one linearised quadratic term

DOI10.1016/j.orl.2013.09.011zbMath1287.90089OpenAlexW2018218013MaRDI QIDQ2450761

Frank Fischer, Anja Fischer

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.09.011

zbMATH Keywords

polyhedral combinatoricsspanning tree problemcomplete descriptionquadratic zero-one problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (8)

Matroid optimisation problems with nested non-linear monomials in the objective function ⋮ The quadratic minimum spanning tree problem and its variations ⋮ Combinatorial optimization with one quadratic term: spanning trees and forests ⋮ A characterization of linearizable instances of the quadratic minimum spanning tree problem ⋮ Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs ⋮ Multilinear sets with two monomials and cardinality constraints

Cites Work

• Unnamed Item
• Solving the quadratic minimum spanning tree problem
• Combinatorial optimization with one quadratic term: spanning trees and forests
• A survey for the quadratic assignment problem
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• Geometric algorithms and combinatorial optimization.
• Matroids and the greedy algorithm
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Complete description for the spanning tree problem with one linearised quadratic term