default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSay Leng Goh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Emily Sing Kiang Siew
, San-Nah Sze, Say Leng Goh, Graham Kendall, Nasser R. Sabar, Salwani Abdullah:
A Survey of Solution Methodologies for Exam Timetabling Problems. IEEE Access 12: 41479-41498 (2024)- [j12]Chong Man Ngoo, Say Leng Goh, San-Nah Sze, Nasser R. Sabar, Mohd. Hanafi Ahmad Hijazi, Graham Kendall:
A survey of mat-heuristics for combinatorial optimisation problems: Variants, trends and opportunities. Appl. Soft Comput. 164: 111947 (2024) - [j11]Andrew Wei-Loong Wong, Say Leng Goh, Mohammad Kamrul Hasan, Salmah Fattah:
Multi-Hop and Mesh for LoRa Networks: Recent Advancements, Issues, and Recommended Applications. ACM Comput. Surv. 56(6): 136:1-136:43 (2024) - 2023
- [j10]Zi Xuan Loke, Say Leng Goh, Graham Kendall, Salwani Abdullah, Nasser R. Sabar:
Portfolio Optimization Problem: A Taxonomic Review of Solution Methodologies. IEEE Access 11: 33100-33120 (2023) - [j9]Sina Abdipoor, Razali Yaakob, Say Leng Goh, Salwani Abdullah:
Meta-heuristic approaches for the University Course Timetabling Problem. Intell. Syst. Appl. 19: 200253 (2023) - 2022
- [j8]Chong Man Ngoo, Say Leng Goh, San-Nah Sze, Nasser R. Sabar, Salwani Abdullah, Graham Kendall:
A Survey of the Nurse Rostering Solution Methodologies: The State-of-the-Art and Emerging Trends. IEEE Access 10: 56504-56524 (2022) - [j7]Say Leng Goh, San-Nah Sze, Nasser R. Sabar, Salwani Abdullah, Graham Kendall:
A 2-Stage Approach for the Nurse Rostering Problem. IEEE Access 10: 69591-69604 (2022) - [j6]Nasser R. Sabar, Say Leng Goh, Ayad Turky, Graham Kendall:
Population-Based Iterated Local Search Approach for Dynamic Vehicle Routing Problems. IEEE Trans Autom. Sci. Eng. 19(4): 2933-2943 (2022) - 2021
- [j5]Mei Ching Chen, San-Nah Sze, Say Leng Goh, Nasser R. Sabar, Graham Kendall:
A Survey of University Course Timetabling Problem: Perspectives, Trends and Opportunities. IEEE Access 9: 106515-106529 (2021) - [j4]Joo Siang Tan, Say Leng Goh, Graham Kendall, Nasser R. Sabar:
A survey of the state-of-the-art of optimisation methodologies in school timetabling problems. Expert Syst. Appl. 165: 113943 (2021) - [j3]Joo Siang Tan, Say Leng Goh, Suaini Sura, Graham Kendall, Nasser R. Sabar:
Hybrid particle swarm optimization with particle elimination for the high school timetabling problem. Evol. Intell. 14(4): 1915-1930 (2021)
2010 – 2019
- 2019
- [j2]Say Leng Goh, Graham Kendall, Nasser R. Sabar:
Simulated annealing with improved reheating and learning for the post enrolment course timetabling problem. J. Oper. Res. Soc. 70(6): 873-888 (2019) - 2017
- [b1]Say Leng Goh:
An investigation of Monte Carlo tree search and local search for course timetabling problems. University of Nottingham, UK, 2017 - [j1]Say Leng Goh, Graham Kendall, Nasser R. Sabar:
Improved local search approaches to solve the post enrolment course timetabling problem. Eur. J. Oper. Res. 261(1): 17-29 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
