Simulated annealing algorithm for the robust spanning tree problem
Year of publication: |
2008
|
---|---|
Authors: | Nikulin, Yury |
Published in: |
Journal of heuristics. - Norwell, Mass. [u.a.] : Springer Science + Business Media, ISSN 1381-1231, ZDB-ID 1333974-6. - Vol. 14.2008, 4, p. 391-402
|
Subject: | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Algorithmus | Algorithm |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
-
Algorithms for the maximum k-club problem in graphs
Shahinpour, Shahram, (2013)
- More ...
-
Multicriteria airport gate assignment and pareto simulated annealing
Drexl, Andreas, (2005)
-
Flight gate scheduling: State-of-the-art and recent developments
Dorndorf, Ulrich, (2005)
-
Simulated annealing algorithm for the robust spanning tree problem
Nikulin, Yury, (2005)
- More ...