# Solving the Quadratic Minimum Spanning Tree Problem

@article{Cordone2012SolvingTQ, title={Solving the Quadratic Minimum Spanning Tree Problem}, author={Roberto Cordone and Gianluca Passeri}, journal={Applied Mathematics and Computation}, year={2012}, volume={218}, pages={11597-11612} }

- Published 2012 in Applied Mathematics and Computation
DOI:10.1016/j.amc.2012.05.043

Given an undirected graph with costs associated to its edges and pairs of edges, the Quadratic Minimum Spanning Tree Problem (QMSTP) requires to determine a spanning tree of minimum total cost. This is a proper model for network problems in which both routing and interference costs need to be considered. It is NP-hard in the strong sense and not approximable unless P 1⁄4 NP. This paper describes a Tabu Search algorithm, with two independent and adaptively tuned tabu lists, and a Variable… CONTINUE READING

#### Citations

##### Publications citing this paper.

Showing 1-10 of 15 extracted citations

## A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem

View 10 Excerpts

Highly Influenced

## Combinatorial optimization with one quadratic term: Spanning trees and forests

View 6 Excerpts

Highly Influenced

## Lower bounds and exact algorithms for the quadratic minimum spanning tree problem

View 7 Excerpts

Highly Influenced

## Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation

View 4 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-10 of 22 references

## A swarm intelligence approach to the quadratic minimum spanning tree problem

View 16 Excerpts

Highly Influenced

## The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm

View 15 Excerpts

Highly Influenced

## The edge-window-decoder representation for tree-based problems

View 13 Excerpts

Highly Influenced

## Metaheuristic Approaches for the Quadratic Minimum Spanning Tree Problem

View 4 Excerpts

Highly Influenced

## Tabu search vs

View 3 Excerpts

## Fuzzy quadratic minimum spanning tree problem

View 1 Excerpt