A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
Year of publication: |
2015
|
---|---|
Authors: | Ruiz, Efrain ; Albareda-Sambola, Maria ; Fernández, Elena ; Resende, Mauricio G. C. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 57.2015, p. 95-108
|
Subject: | Optimization | Combinatorial optimization | Networks | Graphs | Trees | Spanning trees | Capacitated minimum spanning tree | Heuristics | Biased random-key genetic algorithm | Graphentheorie | Graph theory | Heuristik | Evolutionärer Algorithmus | Evolutionary algorithm | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
A biased random-key genetic algorithm for the maximum quasi-clique problem
Pinto, Bruno Q., (2018)
-
Constrained min-cut replication for K-way hypergraph partitioning
Yazici, Volkan, (2014)
-
A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
Singh, Kavita, (2019)
- More ...
-
Biased random-key genetic algorithms with applications in telecommunications
Resende, Mauricio G. C., (2012)
-
P.G. Petroianu, Larissa, (2020)
-
Greedy randomized adaptive search procedures
Feo, Thomas A., (1995)
- More ...