A decomposed metaheuristic approach for a real-world university timetabling problem (Q2378402): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.01.043 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074595274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming models and algorithms for a class--faculty assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assigning students to course sections using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized class-teacher model for some timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-predefined approach to course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2781959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-retrieval case-based reasoning for course timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-based hyper-heuristic for educational timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent research directions in automated timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Case-based heuristic selection for timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for high school timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for computing an operational timetable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solutions for a university timetabling problem through integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for large scale timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a feasible course schedule using Tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for University Course Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of metaheuristic-based techniques for university timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search approach to the constraint satisfaction problem as a general problem solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computerised decision aid for timetabling --- a case analysis / rank
 
Normal rank

Latest revision as of 23:24, 28 June 2024

scientific article
Language Label Description Also known as
English
A decomposed metaheuristic approach for a real-world university timetabling problem
scientific article

    Statements

    A decomposed metaheuristic approach for a real-world university timetabling problem (English)
    0 references
    0 references
    0 references
    0 references
    8 January 2009
    0 references
    0 references
    metaheuristics
    0 references
    timetabling
    0 references
    tabu search
    0 references
    decomposed heuristic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references