An overview of curriculum-based course timetabling (Q2355018): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3500150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curriculum-based course timetabling with SAT and MaxSAT / 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: Answer set programming as a modeling language for course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent research directions in automated 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: Decomposition, reformulation, and diving in university course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A supernodal formulation of vertex colouring with applications in course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut procedure for the Udine course timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for curriculum-based course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective hybrid algorithm for university course timetabling / 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: Neighborhood portfolio approach for local search applied to timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary multi-criterion optimization. 5th international conference, EMO 2009, Nantes, France, April 7--10, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying the threshold accepting metaheuristic to~curriculum based course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive large neighborhood search for the curriculum-based course timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the examination timetabling problem in GPUs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curriculum based course timetabling: new solutions to Udine benchmark instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817405 / 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: Metaheuristics for University Course Timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Applicable Synthetic Instances for Branch Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive tabu search for course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational approach to enhancing course timetabling with integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness in academic course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: ITC2007 solver description: a hybrid approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming methods for large-scale practical classroom assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of hyper-heuristics for educational timetabling / 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: Timetabling problems at the TU Eindhoven / rank
 
Normal rank

Latest revision as of 14:19, 10 July 2024

scientific article
Language Label Description Also known as
English
An overview of curriculum-based course timetabling
scientific article

    Statements

    An overview of curriculum-based course timetabling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2015
    0 references
    university timetabling
    0 references
    curriculum-based course timetabling
    0 references
    survey
    0 references
    models
    0 references
    exact algorithms
    0 references
    heuristic algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references