Compactness and balancing in scheduling (Q4145144): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Timetabling Problem / 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: Q5627909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Particular Conference Scheduling Problem / rank
 
Normal rank

Revision as of 21:35, 12 June 2024

scientific article; zbMATH DE number 3575354
Language Label Description Also known as
English
Compactness and balancing in scheduling
scientific article; zbMATH DE number 3575354

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references