The Quadratic Minimum Spanning Tree Problem and its Variations

@article{Custic2018TheQM,
  title={The Quadratic Minimum Spanning Tree Problem and its Variations},
  author={Ante Custic and Ruonan Zhang and Abraham P. Punnen},
  journal={Discrete Optimization},
  year={2018},
  volume={27},
  pages={73-87}
}
The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree problem with conflict pair constraints, and the bottleneck spanning tree problem with conflict pair constraints are useful in modeling various real life applications. All these problems are known to be NP-hard. In this paper, we investigate these problems to obtain additional insights into the structure of the problems and to identify possible… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS
6 Citations
32 References
Similar Papers

References

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

The quadratic minimum spanning tree problem

  • A. Assad, W. Xu
  • Naval Research Logistics 39
  • 1992
Highly Influential
5 Excerpts

Paths

  • A. Darmann, U. Pferschy, S. Schauer, G. J. Woeginger
  • trees and matchings under disjunctive constraints…
  • 2011
Highly Influential
8 Excerpts

Branch - andcut and Branchandcutandprice algorithms for the adjacent only quadratic minimum spanning tree problem

  • A. S. da Cunha
  • Networks
  • 2015

M

  • D. L. Pereira
  • Gendreau and A.S. da Cunha, Lower bounds and…
  • 2015
2 Excerpts

C

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

Evolutionary algorithms for the bi-objective adjacent only quadratic spanning tree

  • S.M.D.M. Maia, E.F.G. Goldbarg, M. C. Goldbarg
  • International Journal of Innovative Computing and…
  • 2014

Similar Papers

Loading similar papers…