A cutoff time strategy based on the coupon collector's problem
Year of publication: |
2020
|
---|---|
Authors: | Lobo, Fernando G. ; Bazargani, Mosab ; Burke, Edmund K. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 286.2020, 1 (1.10.), p. 101-114
|
Subject: | Metaheuristcs | Stochastic local search | Late acceptance hill-climbing | Cutoff time | Coupon collector’s problem |
-
Late acceptance hill-climbing for high school timetabling
Fonseca, George H. G., (2016)
-
Ribeiro, Celso, (2012)
-
Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
Pagnozzi, Federico, (2019)
- More ...
-
The simplified partial digest problem: Approximation and a graph-theoretic model
Blazewicz, Jacek, (2011)
-
The falling tide algorithm: A new multi-objective approach for complex workforce scheduling
Li, Jingpeng, (2012)
-
Effective learning hyper-heuristics for the course timetabling problem
Soria-Alcaraz, Jorge A., (2014)
- More ...