Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
type: Item
instance of: scholarly article
title: Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
zbMATH Open document ID: 1189.90181
author: Zahra Naji-Azimi
author: Majid Salari
author: Paolo Toth
author: Bruce Golden
author: S. Raghavan
published in: Computers \& Operations Research
publication date: 2010-06-11T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5720293
zbMATH Keywords: minimum spanning tree problem
zbMATH Keywords: minimum label spanning tree problem
zbMATH Keywords: heuristics
zbMATH Keywords: mixed integer programming
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: genetic algorithm
describes a project that uses: TSPLIB
MaRDI profile type: Publication
OpenAlex ID: W2049274343
cites work: Local search for the minimum label spanning tree problem with bounded color classes.
cites work: The minimum labeling spanning trees
cites work: Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
cites work: Q4515163
cites work: On the minimum label spanning tree problem
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q4845371
cites work: Variable neighborhood search
cites work: Q4739657
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A note on the minimum label spanning tree.
cites work: Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
DOI: 10.1016/J.COR.2009.12.013
Recommended article: Variable neighborhood search for the degree-constrained minimum spanning tree problem
Recommended article: Variable neighbourhood search for the minimum labelling Steiner tree problem
Recommended article: Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
Recommended article: General variable neighborhood search for the minimum stretch spanning tree problem
Recommended article: Variable neighbourhood search for the \(k\)-labelled spanning forest problem
Recommended article: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
Recommended article: Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
Recommended article: Solving the minimum labelling spanning tree problem using hybrid local search
Recommended article: On the bicriterion - minimal cost/minimal label - spanning tree problem
description: scientific article; zbMATH DE number 5720293