Comparison of Heuristics for Solving the GMLST Problem

Yiwei Chen, Namrata Cornick, Andrew O. Hall, Ritvik Shajpal, John Silberholz, Inbal Yahav, Bruce L. Golden

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


Given a graph G whose edges are labeled with one or more labels, the Generalized Minimum Label Spanning Tree problem seeks the spanning tree over this graph that uses the least number of labels. We provide a mathematical model for this problem and propose effective greedy heuristics and metaheuristics. We finally compare the results of these algorithms with benchmark heuristics for the related Minimum Label Spanning Tree problem.

Original languageEnglish
Pages (from-to)191-212
Number of pages22
JournalOperations Research/ Computer Science Interfaces Series
StatePublished - 2008
Externally publishedYes


  • Combinatorial optimization
  • Computational comparison
  • Genetic algorithm
  • Greedy heuristic
  • Metaheuristic
  • Minimum label spanning tree


Dive into the research topics of 'Comparison of Heuristics for Solving the GMLST Problem'. Together they form a unique fingerprint.

Cite this