A rapid learning automata-based approach for generalized minimum spanning tree problem

DOI10.1007/s10878-020-00605-0zbMath1466.90094OpenAlexW3035114326MaRDI QIDQ2023120

Kamal Mirzaie, Masoumeh Zojaji, Mohammad Reza Mollakhalili Meybodi

Publication date: 3 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00605-0

zbMATH Keywords

learning automatainduced subgraphrandom searchcombinatorial optimization problemsgeneralized minimum spanning tree

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Cellular Automata, Learning Automata, and Cellular Learning Automata for Optimization

Uses Software

• TSPLIB

Cites Work

• Data mining of social networks represented as graphs
• A survey on optimization metaheuristics
• Upper and lower bounding strategies for the generalized minimum spanning tree problem
• A tabu search heuristic for the generalized minimum spanning tree problem
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• Generalized Steiner problems and other variants
• A new relaxation method for the generalized minimum spanning tree problem
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• On the generalized minimum spanning tree problem

This page was built for publication: A rapid learning automata-based approach for generalized minimum spanning tree problem