Computational models for timetabling problem (Q478951): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Design and implementation of a course scheduling system using Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of a cutting plane algorithm for university course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalising Patterns in Timetables: Novel Integer Programming Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent research directions in automated 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 integer programming formulation for a case study in university timetabling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of a real-world university-course timetabling model solved by integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint programming approach for school timetabling. / rank
 
Normal rank

Revision as of 09:24, 9 July 2024

scientific article
Language Label Description Also known as
English
Computational models for timetabling problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references