Variable neighbourhood search for the minimum labelling Steiner tree problem

DOI10.1007/S10479-008-0507-YzbMATH Open1184.90134OpenAlexW2066622420MaRDI QIDQ2267296FDOQ2267296

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

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

zbMATH Keywords

graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

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