A GRASP algorithm for the multi-criteria minimum spanning tree problem
type: Item
instance of: scholarly article
title: A GRASP algorithm for the multi-criteria minimum spanning tree problem
zbMATH Open document ID: 1155.90446
author: José Elias Claudio Arroyo
author: Pedro Vieira
author: Dalessandro Soares Vianna
published in: Annals of Operations Research
publication date: 2008-09-03T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5320608
zbMATH Keywords: GRASP algorithm
zbMATH Keywords: multi-criteria combinatorial optimization
zbMATH Keywords: minimum spanning tree
describes a project that uses: Genocop
describes a project that uses: GRASP
MaRDI profile type: Publication
full work available at URL: s10479-007-0263-4
OpenAlex ID: W2130651948
cites work: A partial enumeration heuristic for multi-objective flowshop scheduling problems
cites work: Introduction to algorithms
cites work: A survey and annotated bibliography of multiobjective combinatorial optimization
cites work: Connectedness of efficient solutions in multiple criteria combinatorial optimization
cites work: Greedy randomized adaptive search procedures
cites work: An annotated bibliography of GRASP – Part I: Algorithms
cites work: Q4352217
cites work: On spanning tree problems with multiple objectives
cites work: Multi-objective meta-heuristics: An overview of the current state-of-the-art
cites work: Optimization by Simulated Annealing
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q4873721
cites work: The problem of the optimal biobjective spanning tree
cites work: Q3815146
cites work: Genetic algorithm approach on multi-criteria minimum spanning tree problem
DOI: 10.1007/S10479-007-0263-4
description: scientific article; zbMATH DE number 5320608