Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems

DOI10.1016/j.cor.2009.12.013zbMath1189.90181OpenAlexW2049274343MaRDI QIDQ976011

Paolo Toth, Majid Salari, Zahra Naji-Azimi, S. Raghu Raghavan, Bruce L. Golden

Publication date: 11 June 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.925.2198

zbMATH Keywords

heuristicsmixed integer programmingminimum spanning tree problemgenetic algorithmvariable neighborhood searchminimum label spanning tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems, Multicriteria path and tree problems: discussion on exact algorithms and applications, An exact reduction technique for the k-colour shortest path problem

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• Variable neighborhood search
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• A note on the minimum label spanning tree.
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
• TSPLIB—A Traveling Salesman Problem Library