On the public citation graph
Random partial neighborhood search for the post-enrollment course timetabling problem
0 signed · 54 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-387-25383-1_3openalex-snapshot
A Tabu Search Heuristic for a University Timetabling Problem
inferredcites →https://doi.org/10.1007/11593577_7openalex-snapshot
The University Course Timetabling Problem with a Three-Phase Approach
inferredcites →https://doi.org/10.1007/3-540-45724-0_1openalex-snapshot
A MAX-MIN Ant System for the University Course Timetabling Problem
inferredcites →https://doi.org/10.1007/978-3-319-10762-2_77openalex-snapshot
Random Partial Neighborhood Search for University Course Timetabling Problem
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_32openalex-snapshot
ID Walk: A Candidate List Strategy with a Simple Diversification Device
inferredcites →https://doi.org/10.1007/978-3-540-72584-8_71openalex-snapshot
An Extended Implementation of the Great Deluge Algorithm for Course Timetabling
inferredcites →https://doi.org/10.1007/b101971openalex-snapshot
The Traveling Salesman Problem and Its Variations
inferredcites →https://doi.org/10.1007/b107306openalex-snapshot
Metaheuristics: Progress as Real Problem Solvers
inferredcites →https://doi.org/10.1007/s00291-007-0097-0openalex-snapshot
A survey of metaheuristic-based techniques for University Timetabling problems
inferredcites →https://doi.org/10.1007/s10479-009-0644-yopenalex-snapshot
ITC2007 solver description: a hybrid approach
inferredcites →https://doi.org/10.1007/s10479-010-0696-zopenalex-snapshot
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
inferredcites →https://doi.org/10.1007/s10479-010-0737-7openalex-snapshot
Local search and constraint programming for the post enrolment-based course timetabling problem
inferredcites →https://doi.org/10.1007/s10479-012-1078-5openalex-snapshot
Solving the post enrolment course timetabling problem by ant colony optimization
inferredcites →https://doi.org/10.1007/s10489-013-0444-6openalex-snapshot
Population based Local Search for university course timetabling problems
inferredcites →https://doi.org/10.1007/s10852-005-9032-zopenalex-snapshot
Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems
inferredcites →https://doi.org/10.1007/s10951-006-8495-8openalex-snapshot
An effective hybrid algorithm for university course timetabling
inferredcites →https://doi.org/10.1007/s10951-010-0202-0openalex-snapshot
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling
inferredcites →https://doi.org/10.1016/j.cie.2014.11.010openalex-snapshot
A survey of approaches for university course timetabling problem
inferredcites →https://doi.org/10.1016/j.cor.2011.09.014openalex-snapshot
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem
inferredcites →https://doi.org/10.1016/j.ejor.2005.08.012openalex-snapshot
A graph-based hyper-heuristic for educational timetabling problems
inferredcites →https://doi.org/10.1016/j.ejor.2014.03.046openalex-snapshot
Effective learning hyper-heuristics for the course timetabling problem
inferredcites →https://doi.org/10.1023/b:heur.0000012446.94732.b6openalex-snapshot
A Tabu-Search Hyperheuristic for Timetabling and Rostering
inferredcites →https://doi.org/10.1109/tsmcc.2011.2174356openalex-snapshot
University Course Timetabling Using a Hybrid Harmony Search Metaheuristic Algorithm
inferredcites →https://doi.org/10.2298/yjor0302139bopenalex-snapshot
A time-predefined approach to course timetabling
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4757706openalex-extracted
Personalized Course Timetabling by Adaptive Multi-Objective Neighborhood Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-28540-0_13openalex-snapshot
Artificial Orca Algorithm for Solving University Course Timetabling Issue
inferred← citeshttps://doi.org/10.1007/978-3-031-88705-5_25openalex-snapshot
Scheduling for Lecturers Using Genetic Algorithm with Fuzzy Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-09156-7_21openalex-snapshot
The Post-Enrollment Course Timetabling Problem with Flexible Teacher Assignments
inferred← citeshttps://doi.org/10.1007/978-981-96-5013-2_11openalex-snapshot
A Systematic Literature Review of Optimization Algorithms for the University Course Timetabling Problem
inferred← citeshttps://doi.org/10.1007/s10489-020-01833-xopenalex-snapshot
A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local search
inferred← citeshttps://doi.org/10.1007/s10951-022-00747-5openalex-snapshot
Simulated annealing with penalization for university course timetabling
inferred← citeshttps://doi.org/10.1007/s12065-020-00438-0openalex-snapshot
Novel operators for quantum evolutionary algorithm in solving timetabling problem
inferred← citeshttps://doi.org/10.1007/s12597-020-00444-xopenalex-snapshot
An effective hybrid local search approach for the post enrolment course timetabling problem
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111396openalex-snapshot
The professional driver training timetabling problem: MILP formulations and efficient heuristic
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.07.011openalex-snapshot
Educational timetabling: Problems, benchmarks, and state-of-the-art results
inferred← citeshttps://doi.org/10.1016/j.iswa.2023.200253openalex-snapshot
Meta-heuristic approaches for the University Course Timetabling Problem
inferred← citeshttps://doi.org/10.1109/access.2021.3100613openalex-snapshot
A Survey of University Course Timetabling Problem: Perspectives, Trends and Opportunities
inferred← citeshttps://doi.org/10.1109/access.2024.3463721openalex-snapshot
Timetabling Problems and the Effort Toward Generic Algorithms: A Comprehensive Survey
inferred← citeshttps://doi.org/10.1109/icdm59182.2024.00059openalex-snapshot
Towards Dynamic University Course Timetabling Problem: An Automated Approach Augmented via Reinforcement Learning
inferred← citeshttps://doi.org/10.1145/3512290.3528689openalex-snapshot
Understanding the cost of fitness evaluation for subset selection
inferred← citeshttps://doi.org/10.1145/3575879.3575970openalex-snapshot
An exact based approach for the Post Enrollment Course Timetabling Problem
inferred← citeshttps://doi.org/10.1145/3583133.3590545openalex-snapshot
Controlling Hybrid Evolutionary Algorithms in Subset Selection for Multimodal Optimization
inferred← citeshttps://doi.org/10.1155/2018/8958393openalex-snapshot
An Assignment Problem and Its Application in Education Domain: A Review and Potential Path
inferred← citeshttps://doi.org/10.1155/2020/2871835openalex-snapshot
A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics
inferred← citeshttps://doi.org/10.11591/eei.v10i6.3206openalex-snapshot
Timetabling problem solving based on best-nests cuckoo search
inferred← citeshttps://doi.org/10.18421/sar74-02openalex-snapshot
Optimizing Course Scheduling with Genetic Algorithms: A Dynamic Approach
inferred← citeshttps://doi.org/10.2139/ssrn.4669772openalex-snapshot
Timetabling Problems and the Effort Towards Generic Algorithms: A Comprehensive Survey
inferred← citeshttps://doi.org/10.23919/ccc55666.2022.9901627openalex-snapshot
An Optimal Timetabling Algorithm of University Course Based on Dynamic Resource Margin
inferred← citeshttps://doi.org/10.28932/jis.v6i1.6459openalex-snapshot
Penjadwalan Mata Kuliah dengan Mempertimbangkan Ketersediaan Waktu Pengajar dan Satuan Kredit Semester yang Tidak Terpisah Menggunakan Integer Linear Programming
inferred← citeshttps://doi.org/10.3390/educsci15020119openalex-snapshot
Assessment of the Sustainability of University Academic Programs for the Accreditation: A Complex Challenge
inferred← citeshttps://doi.org/10.35940/ijrte.b1082.0882s819openalex-snapshot
Sequential Integer Programming for Solving Curriculum-Based University Course Timetabling Problem
inferred← citeshttps://doi.org/10.3837/tiis.2024.04.002openalex-snapshot
A Novel and Effective University Course Scheduler Using Adaptive Parallel Tabu Search and Simulated Annealing
inferred← citeshttps://doi.org/10.46661/rev.metodoscuant.econ.empresa.7354openalex-snapshot
Modelos de Programación Entera para el Problema de Aignación de Horarios en Cursos Universitarios
inferred← citeshttps://doi.org/10.71112/cxe0ee85openalex-snapshot
Automatización de horarios escolares como modelo de transformación de la gestión educativa en la Jornada escolar extendida de la república dominicana.
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.