Solving the minimum labelling spanning tree problem using hybrid local search

DOI10.1016/j.endm.2012.10.011zbMath1268.90137OpenAlexW2100126548MaRDI QIDQ2840755

No author found.

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationnetworksgraphshybrid metaheuristicsvariable neighbourhood searchminimum labelling spanning trees

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Carousel greedy: a generalized greedy algorithm with applications in optimization ⋮ Finding minimum label spanning trees using cross‐entropy method ⋮ A hybrid metaheuristic for the minimum labeling spanning tree problem ⋮ An exact algorithm for the minimum quartet tree cost problem

Cites Work

• Optimization by Simulated Annealing
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• Variable neighborhood search: Principles and applications

This page was built for publication: Solving the minimum labelling spanning tree problem using hybrid local search