An effective genetic algorithm approach to the quadratic minimum spanning tree problem (Q1389197): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On lower bounds for a class of quadratic 0,1 programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on two problems in connexion with graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the History of the Minimum Spanning Tree Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4315824 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An approach to a problem in network design using genetic algorithms / rank | |||
Normal rank |
Revision as of 13:00, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An effective genetic algorithm approach to the quadratic minimum spanning tree problem |
scientific article |
Statements
An effective genetic algorithm approach to the quadratic minimum spanning tree problem (English)
0 references
19 January 1999
0 references
minimum spanning tree
0 references
genetic algorithm
0 references
Prüfer number
0 references
network optimization
0 references