Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem-Reference-Cited by-同舟云学术

Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem

Published:2009-07 Issue:2 Volume:196 Page:440-449
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Consoli S.,Darby-Dowman K.,Mladenović N.,Moreno Pérez J.A.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference27 articles.

1. Graph Theory and Combinatorial Optimization;Avis,2005

2. Local search for the minimum label spanning tree problem with bounded colour classes;Brüggemann;Operations Research Letters,2003

3. Metaheuristics comparison for the minimum labelling spanning tree problem;Cerulli,2005

4. The minimum labeling spanning trees;Chang;Information Processing Letters,1997

5. Consoli, S., 2007. Test datasets for the minimum labelling spanning tree problem. http://people.brunel.ac.uk/~mapgssc/MLSTP.htm [online].

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

1. The Budgeted Labeled Minimum Spanning Tree Problem;Mathematics;2024-01-10

2. Community-based zigzag piloting algorithm for the strong generalized minimum label spanning tree problem;Soft Computing;2023-11-24

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

4. Community-based Zigzag Piloting Algorithm for the Strong Generalized Minimum Label Spanning Tree Problem;2022-12-14

5. An Efficient Variable Neighborhood Search for Generalized Regenerator Location Problems;International Journal on Artificial Intelligence Tools;2022-08