A hybrid metaheuristic for the minimum labeling spanning tree problem

DOI10.1016/j.ejor.2018.09.044zbMath1430.90541OpenAlexW2895324310MaRDI QIDQ1755227

Luiz Satoru Ochi, Thiago Gouveia da Silva, Serigne Gueye, Eduardo Queiroga, Philippe Yves Paul Michelon, Lucidio dos Anjos Formiga Cabral

Publication date: 9 January 2019

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.09.044

zbMATH Keywords

spanning treemetaheuristiccomplexity analysisedge-labeled graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

The rainbow Steiner tree problem ⋮ Finding minimum label spanning trees using cross‐entropy method ⋮ An exact reduction technique for the k-colour shortest path problem

Cites Work

• Solving the minimum label spanning tree problem by mathematical programming techniques
• Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
• The labeled maximum matching problem
• A mixed integer linear formulation for the minimum label spanning tree problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• Local branching
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• Carousel greedy: a generalized greedy algorithm with applications in optimization
• The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005.
• 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
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• Solving the minimum labelling spanning tree problem using hybrid local search
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A hybrid metaheuristic for the minimum labeling spanning tree problem