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

@article{Rostami2015LowerBF,
  title={Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation},
  author={Borzou Rostami and Federico Malucelli},
  journal={Computers & OR},
  year={2015},
  volume={64},
  pages={178-188}
}
The Minimum Spanning Tree Problem (MSTP) is one of the most known combinatorial optimization problems. It concerns the determination of a minimum edge-cost subgraph spanning all the vertices of a given connected graph. The Quadratic Minimum Spanning Tree Problem (QMSTP) is a variant of the MST whose cost considers also the interaction between every pair of edges of the tree. In this paper we review different strategies found in the literature to compute a lower bound for the QMSTP and develop… CONTINUE READING

References

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

Optimal and suboptimal algorithms for the quadratic assignment problem

  • P. C. Gilmore
  • Journal of the Society for Industrial & Applied…
  • 1962
Highly Influential
6 Excerpts

C

  • M. Lozano, F. Glover
  • Garćıa-Mart́ınez, F. J. Rodŕıguez, R. Mart…
  • 2014
1 Excerpt

Tabu search with strategic oscillation for the quadratic minimum spanning tree

  • F. Glover, F. J. Rodŕıguez C. Garćıa-Mart́ınez
  • IIE Transactions
  • 2014

Similar Papers

Loading similar papers…