A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-015-0424-2 / 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: Bipartite Edge Coloring in $O(\Delta m)$ Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large scale timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Is the Classroom Assignment Problem Hard? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Edge Coloring Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity analysis and an algorithmic approach to student sectioning in existing timetables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timetable construction: the algorithms and complexity perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5518886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779799 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-015-0424-2 / rank
 
Normal rank

Latest revision as of 14:04, 9 December 2024

scientific article
Language Label Description Also known as
English
A complexity analysis and an algorithmic approach to student sectioning in existing timetables
scientific article

    Statements

    A complexity analysis and an algorithmic approach to student sectioning in existing timetables (English)
    0 references
    0 references
    0 references
    8 September 2016
    0 references
    educational timetabling
    0 references
    student scheduling
    0 references
    complexity analysis
    0 references

    Identifiers