Timetabling problems at the TU Eindhoven (Q5902305): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.ejor.2008.04.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064237446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / 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: Recent research directions in automated 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 introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a university course and examination timetabling system / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3198899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computerised decision aid for timetabling --- a case analysis / rank
 
Normal rank

Latest revision as of 06:42, 2 July 2024

scientific article; zbMATH DE number 5642750
Language Label Description Also known as
English
Timetabling problems at the TU Eindhoven
scientific article; zbMATH DE number 5642750

    Statements

    Timetabling problems at the TU Eindhoven (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2009
    0 references
    0 references
    integer programming
    0 references
    university timetabling
    0 references
    network flow formulation
    0 references
    NP-completeness
    0 references
    lexicographical optimization
    0 references
    0 references