An effective genetic algorithm approach to the quadratic minimum spanning tree problem

DOI10.1016/S0305-0548(97)00039-7zbMath0904.90169OpenAlexW2020384435WikidataQ126851753 ScholiaQ126851753MaRDI QIDQ1389197

Gengui Zhou, Mitsuo Gen

Publication date: 19 January 1999

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00039-7

zbMATH Keywords

genetic algorithmminimum spanning treenetwork optimizationPrüfer number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (15)

Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems ⋮ Lower bounds and exact algorithms for the quadratic minimum spanning tree problem ⋮ Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation ⋮ The quadratic minimum spanning tree problem and its variations ⋮ Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem ⋮ Solving the quadratic minimum spanning tree problem ⋮ Combinatorial optimization with one quadratic term: spanning trees and forests ⋮ A characterization of linearizable instances of the quadratic minimum spanning tree problem ⋮ The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm ⋮ Fuzzy quadratic minimum spanning tree problem ⋮ Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem ⋮ Genetic algorithm approach on multi-criteria minimum spanning tree problem ⋮ Fuzzy α-minimum spanning tree problem: definition and solutions ⋮ Concentration inequalities for nonlinear matroid intersection ⋮ Unnamed Item

Uses Software

• Genocop

Cites Work

• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• On lower bounds for a class of quadratic 0,1 programs
• On the History of the Minimum Spanning Tree Problem
• An approach to a problem in network design using genetic algorithms
• Unnamed Item

This page was built for publication: An effective genetic algorithm approach to the quadratic minimum spanning tree problem