An integer programming formulation for a case study in university timetabling. (Q1417497): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for computing the optimum university timetable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large scale timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective course scheduling model: Combining faculty preferences for courses and times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timetabling for Greek high schools / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for computing an operational timetable / rank
 
Normal rank
Property / cites work
 
Property / cites work: University timetabling by constraint-based reasoning: A case study / 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: Distribution requirements and compactness constraints in school timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization Problems with Soft and Hard Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timetabling problem for university as assignment of activities to resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a feasible course schedule using Tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The teacher assignment problem: A special case of the fixed charge transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic approach to the resolution of constraints in timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: School Timetabling—A Case in Large Binary Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computerised decision aid for timetabling --- a case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The combinatorics of timetabling / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(03)00103-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993342066 / rank
 
Normal rank

Latest revision as of 10:39, 30 July 2024

scientific article
Language Label Description Also known as
English
An integer programming formulation for a case study in university timetabling.
scientific article

    Statements

    An integer programming formulation for a case study in university timetabling. (English)
    0 references
    0 references
    5 January 2004
    0 references
    Timetabling
    0 references
    Integer programming
    0 references
    University timetabling
    0 references
    0 references
    0 references

    Identifiers