A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
Year of publication: |
2019
|
---|---|
Authors: | Singh, Kavita ; Sundar, Shyam |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 276.2019, 1 (1.7.), p. 88-105
|
Subject: | Combinatorial optimization | Min-degree constrained spanning tree problem | Steady-state genetic algorithm | Problem-specific genetic operators | Fast local search | Evolutionärer Algorithmus | Evolutionary algorithm | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Heuristik | Heuristics |
-
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Ruiz, Efrain, (2015)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
New genetic algorithm approach for the min-degree constrained minimum spanning tree
Salgueiro, Rui, (2017)
- More ...
-
Two heuristics for the rainbow spanning forest problem
Ghoshal, Sudishna, (2020)
-
A hybrid evolutionary approach for set packing problem
Chaurasia, Sachchida Nand, (2015)
-
A hybrid heuristic for the set covering problem
Sundar, Shyam, (2012)
- More ...