Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure
Crossref DOI link: https://doi.org/10.1007/s10479-017-2646-5
Published Online: 2017-10-16
Published Print: 2019-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ermis, Gülcin
Akkan, Can http://orcid.org/0000-0002-1932-7826
Funding for this research was provided by:
Türkiye Bilimsel ve Teknolojik Araştirma Kurumu (214M661)
Text and Data Mining valid from 2017-10-16
Article History
First Online: 16 October 2017