Comparison of metaheuristics for the k‐labeled spanning forest problem
DOI10.1111/itor.12217zbMath1471.90120OpenAlexW2523855529MaRDI QIDQ5278227
Nenad Mladenović, Sergio Consoli, José Andrés Moreno-Pérez
Publication date: 13 July 2017
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12217
combinatorial optimizationvariable neighborhood searchgraphs and networksintelligent optimization\(k\)-labeled spanning forestminimum labeling spanning trees
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Looking ahead with the pilot method
- The labeled maximum matching problem
- Tuning metaheuristics. A machine learning Perspective
- Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
- Guest editorial: Hybrid metaheuristics
- Variable neighborhood search
- The minimum labeling spanning trees
- On the minimum label spanning tree problem
- A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
- Local search for the minimum label spanning tree problem with bounded color classes.
- Comparison of heuristics for the colourful travelling salesman problem
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- An annotated bibliography of GRASP-Part II: Applications
- The Colorful Traveling Salesman Problem
- An annotated bibliography of GRASP – Part I: Algorithms
- Matheuristics
- Handbook of Combinatorial Optimization
This page was built for publication: Comparison of metaheuristics for the k‐labeled spanning forest problem
