Comparison of Heuristics for Solving the GMLST Problem

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

doi:10.1007/978-0-387-77780-1_9

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 journal › Article › peer-review

13 Scopus citations

Abstract

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 language	English
Pages (from-to)	191-212
Number of pages	22
Journal	Operations Research/ Computer Science Interfaces Series
Volume	44
DOIs	https://doi.org/10.1007/978-0-387-77780-1_9
State	Published - 2008
Externally published	Yes

Keywords

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

Access to Document

10.1007/978-0-387-77780-1_9

Cite this

@article{61e4a98b51554c289dd8dfceaef00607,

title = "Comparison of Heuristics for Solving the GMLST Problem",

abstract = "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.",

keywords = "Combinatorial optimization, Computational comparison, Genetic algorithm, Greedy heuristic, Metaheuristic, Minimum label spanning tree",

author = "Yiwei Chen and Namrata Cornick and Hall, {Andrew O.} and Ritvik Shajpal and John Silberholz and Inbal Yahav and Golden, {Bruce L.}",

year = "2008",

doi = "10.1007/978-0-387-77780-1_9",

language = "אנגלית",

volume = "44",

pages = "191--212",

journal = "Operations Research/ Computer Science Interfaces Series",

issn = "1387-666X",

publisher = "Springer Science + Business Media",

}

TY - JOUR

T1 - Comparison of Heuristics for Solving the GMLST Problem

AU - Chen, Yiwei

AU - Cornick, Namrata

AU - Hall, Andrew O.

AU - Shajpal, Ritvik

AU - Silberholz, John

AU - Yahav, Inbal

AU - Golden, Bruce L.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Combinatorial optimization

KW - Computational comparison

KW - Genetic algorithm

KW - Greedy heuristic

KW - Metaheuristic

KW - Minimum label spanning tree

UR - http://www.scopus.com/inward/record.url?scp=80052768650&partnerID=8YFLogxK

U2 - 10.1007/978-0-387-77780-1_9

DO - 10.1007/978-0-387-77780-1_9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:80052768650

SN - 1387-666X

VL - 44

SP - 191

EP - 212

JO - Operations Research/ Computer Science Interfaces Series

JF - Operations Research/ Computer Science Interfaces Series

ER -

Comparison of Heuristics for Solving the GMLST Problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this