Solving the minimum labelling spanning tree problem using hybrid local search

DOI10.1016/J.ENDM.2012.10.011MaRDI QIDQ2840755zbMATH OpenOpenAlexFDO

Authors S. Consoli, José Pérez

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 optimizationgraphshybrid metaheuristicsminimum labelling spanning treesnetworksvariable neighbourhood search

Mathematics Subject Classification ID

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

Recommendations

• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• A hybrid metaheuristic for the minimum labeling spanning tree problem
• The minimum labeling spanning trees
• Variable neighbourhood search for the k-labelled spanning forest problem

Cites work

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

Cited in

(10)

• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• The minimum labeling spanning trees
• Carousel greedy: a generalized greedy algorithm with applications in optimization
• A hybrid metaheuristic for the minimum labeling spanning tree problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• An exact algorithm for the minimum quartet tree cost problem
• Variable neighbourhood search for the k-labelled spanning forest problem
• scientific article; zbMATH DE number 222693 (Why is no real title available?)
• Finding minimum label spanning trees using cross‐entropy method
• Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems

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

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