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}
}
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

References

Publications referenced by this paper.
Showing 1-10 of 22 references

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

IEEE Transactions on Evolutionary Computation • 2006
View 13 Excerpts
Highly Influenced

Tabu search vs

R. Aringhieri, R. Cordone, Y. Melzani
GRASP for the maximum diversity problem, 4OR: A Quarterly Journal of Operations Research 6 (1) • 2008
View 3 Excerpts

Fuzzy quadratic minimum spanning tree problem

Applied Mathematics and Computation • 2005
View 1 Excerpt

Chance-constrained programming for fuzzy quadratic minimum spanning tree problem

2004 IEEE International Conference on Fuzzy Systems (IEEE Cat. No.04CH37542) • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…