The robust (minmax regret) quadratic assignment problem with interval flows
Year of publication: |
2014
|
---|---|
Authors: | Feizollahi, Mohammad Javad ; Averbakh, Igor |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 26.2014, 2, p. 321-335
|
Subject: | robust optimization | minmax regret | quadratic assignment problem | Benders decomposition | tabu search | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Entscheidung unter Unsicherheit | Decision under uncertainty | Dekompositionsverfahren | Decomposition method | Robustes Verfahren | Robust statistics | Heuristik | Heuristics |
-
Siddiqui, Sauleh, (2015)
-
Robust quadratic assignment problem with budgeted uncertain flows
Feizollahi, Mohammad Javad, (2015)
-
Benders decomposition applied to a robust multiple allocation incomplete hub location problem
Martins de Sá, Elisangela, (2018)
- More ...
-
Robust quadratic assignment problem with budgeted uncertain flows
Feizollahi, Mohammad Javad, (2015)
-
Robust quadratic assignment problem with budgeted uncertain flows
Feizollahi, Mohammad Javad, (2015)
-
Nash equilibria in competitive project scheduling
Averbakh, Igor, (2010)
- More ...