An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree...
An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
About this item
Full title
Author / Creator
Publisher
Oxford: Blackwell Publishing Ltd
Journal title
Language
English
Formats
Publication information
Publisher
Oxford: Blackwell Publishing Ltd
Subjects
More information
Scope and Contents
Contents
The prize‐collecting generalized minimum spanning tree problem consists of finding a minimum cost spanning tree in an undirected graph, considering that the vertices are divided into clusters, that there is a nonnegative cost associated with each edge, that there is a prize to be collected on each vertex, and that only one vertex of each cluster be...
Alternative Titles
Full title
An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2469410423
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2469410423
Other Identifiers
ISSN
0969-6016
E-ISSN
1475-3995
DOI
10.1111/itor.12880
