Perturbation algorithm for a minimax regret minimum spanning tree problem
Year of publication: |
2014
|
---|---|
Authors: | Makuchowski, Mariusz |
Published in: |
Operations Research and Decisions. - Wydział Informatyki i Zarządzania. - Vol. 1.2014, p. 37-49
|
Publisher: |
Wydział Informatyki i Zarządzania |
Subject: | discrete optimization | robust optimization | perturbation algorithms | minmax regret |
-
Making Robust Decisions in Discrete Optimization Problems as a Game against Nature
Kasperski, Adam, (2008)
-
Chassein, André B., (2015)
-
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
Chassein, André, (2017)
- More ...
-
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
Kasperski, Adam, (2012)
-
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
Kasperski, Adam, (2012)
-
A fast hybrid tabu search algorithm for the no-wait job shop problem
Bożejko, Wojciech, (2009)
- More ...