An effective hybrid algorithm for university course timetabling (Q880559): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62672044, #quickstatements; #temporary_batch_1707232231678
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-006-8495-8 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: EasyLocal++ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HotFrame / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hyperheuristics / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: race / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-006-8495-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108432292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5700829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent research directions in automated timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practice and theory of automated timetabling III. 3rd international conference, PATAT 2000, Konstanz, Germany, August 16--18, 2000. Selected papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779805 / 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: Q4845460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust simulated annealing based examination timetabling system. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-006-8495-8 / rank
 
Normal rank

Latest revision as of 06:51, 10 December 2024

scientific article
Language Label Description Also known as
English
An effective hybrid algorithm for university course timetabling
scientific article

    Statements

    An effective hybrid algorithm for university course timetabling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 May 2007
    0 references
    University course timetabling
    0 references
    Local search methods
    0 references
    Metaheuristics
    0 references
    Hybrid algorithms
    0 references
    Experimental methodology
    0 references
    Algorithm engineering
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers