Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure
Year of publication: |
2019
|
---|---|
Authors: | Ermis, Gülcin ; Akkan, Can |
Published in: |
The practice and theory of automated timetabling (2016). - New York, NY, USA : Springer. - 2019, p. 101-121
|
Subject: | Algorithmus | Algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Pareto-Optimum | Pareto efficiency |
-
Giannopoulos, Nikos, (2018)
-
García-León, Andrés Alberto, (2019)
-
Multiobjective interacting particle algorithm for global optimization
Mete, Huseyin Onur, (2014)
- More ...
-
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Akkan, Can, (2000)
-
Akkan, Can, (2004)
-
Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
Akkan, Can, (2005)
- More ...