A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
Year of publication: |
2012
|
---|---|
Authors: | Kasperski, Adam ; Makuchowski, Mariusz ; Zieliński, Paweł |
Published in: |
Journal of heuristics. - Norwell, Mass. [u.a.] : Springer Science + Business Media, ISSN 1381-1231, ZDB-ID 1333974-6. - Vol. 18.2012, 4, p. 593-625
|
Subject: | Heuristik | Heuristics | Algorithmus | Algorithm | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Laforest, Christian, (2013)
-
Efficient approaches for the Flooding Problem on graphs
Silva, André Renato Villela, (2020)
- More ...
-
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
Kasperski, Adam, (2012)
-
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Kasperski, Adam, (2012)
-
Robust recoverable 0-1 optimization problems under polyhedral uncertainty
Hradovich, Mikita, (2019)
- More ...