An effective genetic algorithm approach to the quadratic minimum spanning tree problem
type: Item
instance of: scholarly article
title: An effective genetic algorithm approach to the quadratic minimum spanning tree problem
zbMATH Open document ID: 0904.90169
DOI: 10.1016/S0305-0548(97)00039-7
author: Gengui Zhou
author: Mitsuo Gen
published in: Computers \& Operations Research
publication date: 1999-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1164393
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: genetic algorithm
zbMATH Keywords: Prüfer number
zbMATH Keywords: network optimization
describes a project that uses: Genocop
MaRDI profile type: Publication
cites work: On lower bounds for a class of quadratic 0,1 programs
cites work: A note on two problems in connexion with graphs
cites work: On the History of the Minimum Spanning Tree Problem
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q4315824
cites work: An approach to a problem in network design using genetic algorithms
Wikidata QID: Q126851753
full work available at URL: s0305-0548(97)00039-7
OpenAlex ID: W2020384435
description: scientific article; zbMATH DE number 1164393