Variable neighbourhood search for the minimum labelling Steiner tree problem

DOI10.1007/s10479-008-0507-yzbMath1184.90134OpenAlexW2066622420MaRDI QIDQ2267296

Kenneth Darby-Dowman, José Andrés Moreno-Pérez, Sergio Consoli, Nenad Mladenović

Publication date: 1 March 2010

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-008-0507-y

zbMATH Keywords

graphs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Comparison of metaheuristics for the k‐labeled spanning forest problem ⋮ Variable neighbourhood search for the \(k\)-labelled spanning forest problem ⋮ The label cut problem with respect to path length and label frequency ⋮ The rainbow Steiner tree problem ⋮ Two heuristics for the rainbow spanning forest problem ⋮ Finding minimum label spanning trees using cross‐entropy method ⋮ Solving the minimum label spanning tree problem by mathematical programming techniques ⋮ On the complexity of rainbow spanning forest problem ⋮ A hybrid metaheuristic for the minimum labeling spanning tree problem ⋮ Variable neighbourhood search: methods and applications ⋮ The rainbow spanning forest problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Looking ahead with the pilot method
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• A probabilistic heuristic for a computationally difficult set covering problem
• The Steiner tree problem
• Variable neighborhood search
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• A note on the minimum label spanning tree.
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
• Steiner problem in networks: A survey
• On the Computational Complexity of Combinatorial Problems
• The Complexity of Computing Steiner Minimal Trees
• Variable Neighborhood Search
• A hybrid VNS–path relinking for the p-hub median problem
• Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients
• A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings