Linear combinations of heuristics for examination timetabling (Q1761893): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Final examination scheduling / 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: Hybrid variable neighbourhood approaches to university exam timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Relaxation Approach To The Classroom Assignment Problem<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted graphs and university course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic optimisation: Limitations, objectives, uses, references / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring conditions for the existence of solutions to the timetable problem / 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: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of search methodologies and automated system development for examination timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A system for computing university examination timetables / rank
 
Normal rank

Latest revision as of 21:02, 5 July 2024

scientific article
Language Label Description Also known as
English
Linear combinations of heuristics for examination timetabling
scientific article

    Statements

    Linear combinations of heuristics for examination timetabling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    examination timetabling
    0 references
    weighted graph
    0 references
    constructive heuristics
    0 references
    heuristic combinations
    0 references
    graph colouring heuristics
    0 references

    Identifiers