A multi-agent transgenetic algorithm for the bi-objective spanning tree problem

DOI10.1016/j.entcs.2019.08.040OpenAlexW2978798956WikidataQ113317392 ScholiaQ113317392MaRDI QIDQ2132380

Elizabeth Ferreira Gouvêa Goldbarg, Silvia M. D. M. Maia, Marco Cesar Goldbarg, Islame F. C. Fernandes

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.040

zbMATH Keywords

combinatorial optimizationevolutionary algorithmsbi -objective spanning tree

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (1)

On solving bi-objective constrained minimum spanning tree problems

Uses Software

• irace
• HypE

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Efficient spanning trees
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• On spanning tree problems with multiple objectives
• The problem of the optimal biobjective spanning tree
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Dynamic programming for spanning tree problems: application to the multi-objective case
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• The multi-criteria minimum spanning tree problem based genetic algorithm
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• The Reactive Tabu Search

This page was built for publication: A multi-agent transgenetic algorithm for the bi-objective spanning tree problem