A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
Year of publication: |
May 2017
|
---|---|
Authors: | Assunção, Lucas ; Noronha, Thiago F. ; Santos, Andréa Cynthia ; Andrade, Rafael |
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. 81.2017, p. 51-66
|
Subject: | Robust optimization | Matheuristics | Benders' decomposition | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics | Dekompositionsverfahren | Decomposition method | Scheduling-Verfahren | Scheduling problem | Robustes Verfahren | Robust statistics |
-
The recoverable robust tail assignment problem
Froyland, Gary, (2014)
-
The robust (minmax regret) quadratic assignment problem with interval flows
Feizollahi, Mohammad Javad, (2014)
-
Benders decomposition applied to a robust multiple allocation incomplete hub location problem
Martins de Sá, Elisangela, (2018)
- More ...
-
Solving diameter-constrained minimum spanning tree problems by constraint programming
Noronha, Thiago F., (2010)
-
Model and methods to address urban road network problems with disruptions
Huang, Yipeng, (2019)
-
Metaheuristics for the work‐troops scheduling problem
Barbalho, Thiago Jobson, (2020)
- More ...