Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem

DOI10.1016/j.ejor.2008.03.014zbMath1163.90766OpenAlexW2102073566MaRDI QIDQ1027523

J. Blot

Publication date: 30 June 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://bura.brunel.ac.uk/handle/2438/3562

zbMATH Keywords

metaheuristicscombinatorial optimisationvariable neighbourhood searchgreedy randomized adaptive search procedureminimum labelling spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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, Carousel greedy: a generalized greedy algorithm with applications in optimization, On the bicriterion - minimal cost/minimal label - spanning tree problem, Finding minimum label spanning trees using cross‐entropy method, Solving the minimum label spanning tree problem by mathematical programming techniques, A hybrid metaheuristic for the minimum labeling spanning tree problem, Discrete particle swarm optimization for the minimum labelling Steiner tree problem, Variable neighbourhood search: methods and applications, Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems, Variable neighbourhood search for the minimum labelling Steiner tree problem, Transshipment service through crossdocks with both soft and hard time windows, Variable neighbourhood search: Methods and applications, Solving the minimum labelling spanning tree problem using hybrid local search, A polyhedral approach to the generalized minimum labeling spanning tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Looking ahead with the pilot method
• Variable neighborhood search
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• Greedy randomized adaptive search procedures
• 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
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
• Approximations of the critical region of the fbietkan statistic
• Variable Neighborhood Search
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications