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

DOI10.1016/J.COR.2009.12.013MaRDI QIDQ976011zbMATH OpenOpenAlexFDO

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

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

genetic algorithmheuristicsminimum label spanning tree problemminimum spanning tree problemmixed integer programmingvariable neighborhood search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• General variable neighborhood search for the minimum stretch spanning tree problem
• Variable neighbourhood search for the k-labelled spanning forest problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
• Solving the minimum labelling spanning tree problem using hybrid local search
• On the bicriterion - minimal cost/minimal label - spanning tree problem

Cites work

• A note on the minimum label spanning tree.
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• scientific article; zbMATH DE number 1528191 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• Local search for the minimum label spanning tree problem with bounded color classes.
• On the minimum label spanning tree problem
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The minimum labeling spanning trees
• TSPLIB—A Traveling Salesman Problem Library
• Variable neighborhood search
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

Cited in

(11)

• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• An exact reduction technique for the k-colour shortest path problem
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• Variable neighbourhood search for the k-labelled spanning forest problem
• scientific article; zbMATH DE number 5005302 (Why is no real title available?)
• 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
• Comparison of metaheuristics for the k-labeled spanning forest problem
• General variable neighborhood search for the minimum stretch spanning tree problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976011)