Comparison of metaheuristics for thek-labeled spanning forest problem-Reference-Cited by-同舟云学术

Comparison of metaheuristics for thek-labeled spanning forest problem

Published:2015-11-20 Issue:3 Volume:24 Page:559-582
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Consoli Sergio¹,Moreno Pérez José Andrés²,Mladenović Nenad³

Affiliation:

1. National Research Council (CNR); Institute of Cognitive Sciences and Technologies; Via Gaifami 18 95028 Catania Italy

2. Department of Computing Engineering; University of La Laguna; 38271 Santa Cruz de Tenerife Spain

3. LAMIH CNRS; University of Valenciennes; F-59313 Valenciennes Cedex 9 France

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/itor.12217/fullpdf

Reference45 articles.

1. Aarts , E. Korst , J. Michiels , W. 2005 Simulated annealing Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques 187 210

2. Tuning Metaheuristics

3. Hybrid metaheuristics;Blum;Computers & Operations Research,2010

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An exact reduction technique for the k-Colour Shortest Path Problem;Computers & Operations Research;2023-01

2. Evaluating the Effects of Chaos in Variable Neighbourhood Search;Metaheuristics;2023

3. A fix-and-optimize matheuristic for the k-labelled spanning forest problem;2022 IEEE Congress on Evolutionary Computation (CEC);2022-07-18

4. Computational comparisons of different formulations for the Stackelberg minimum spanning tree game;International Transactions in Operational Research;2019-05-29