Variable neighbourhood search for the minimum labelling Steiner tree problem

DOI10.1007/S10479-008-0507-YMaRDI QIDQ2267296zbMATH OpenOpenAlexFDO

Authors S. Consoli, Ken Darby-Dowman, José A. Moreno Pérez, 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)

Recommendations

• Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• Variable neighbourhood search for the \(k\)-labelled spanning forest problem
• General variable neighborhood search for the minimum stretch spanning tree problem
• General variable neighborhood search approach to group Steiner tree problem
• Variable neighborhood search for minimal connected subgraph
• Variable neighborhood search for the vertex separation problem
• Discrete particle swarm optimization for the minimum labelling Steiner tree problem

Cites work

• scientific article; zbMATH DE number 4191148 (Why is no real title available?)
• scientific article; zbMATH DE number 710624 (Why is no real title available?)
• scientific article; zbMATH DE number 1094753 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 1373656 (Why is no real title available?)
• scientific article; zbMATH DE number 1374046 (Why is no real title available?)
• scientific article; zbMATH DE number 1424554 (Why is no real title available?)
• scientific article; zbMATH DE number 2205254 (Why is no real title available?)
• A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
• A hybrid VNS–path relinking for the p-hub median problem
• A note on the minimum label spanning tree.
• A probabilistic heuristic for a computationally difficult set covering problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• Looking ahead with the pilot method
• On the Computational Complexity of Combinatorial Problems
• On the minimum label spanning tree problem
• Optimization by simulated annealing
• Simulated annealing
• Statistical comparisons of classifiers over multiple data sets
• Steiner problem in networks: A survey
• Steiner tree problems in telecommunications
• The Complexity of Computing Steiner Minimal Trees
• The Steiner tree problem
• The minimum labeling spanning trees
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
• Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients
• Variable Neighborhood Search
• Variable neighborhood search
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

Cited in

(16)

• The rainbow Steiner tree problem
• General variable neighborhood search approach to group Steiner tree problem
• Variable neighbourhood search for the \(k\)-labelled spanning forest problem
• Two heuristics for the rainbow spanning forest problem
• Variable neighbourhood search: methods and applications
• Finding minimum label spanning trees using cross‐entropy method
• On the complexity of rainbow spanning forest problem
• Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
• Solving the minimum label spanning tree problem by mathematical programming techniques
• The rainbow spanning forest problem
• Solving the minimum labelling spanning tree problem using hybrid local search
• Comparison of metaheuristics for the \(k\)-labeled spanning forest problem
• The label cut problem with respect to path length and label frequency
• Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
• A hybrid metaheuristic for the minimum labeling spanning tree problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem

This page was built for publication: Variable neighbourhood search for the minimum labelling Steiner tree problem

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