scientific article; zbMATH DE number 3910116

MaRDI QIDQ3686417zbMATH OpenFDO

Authors Dominique De Werra

Publication date 1985

zbMATH Keywords

hypergraphsKönig's theoremschool timetabling problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Some uses of hypergraphs in timetabling
• scientific article; zbMATH DE number 2159270
• scientific article; zbMATH DE number 3874960
• scientific article; zbMATH DE number 5762364
• scientific article; zbMATH DE number 874567
• Graphs, hypergraphs and hashing
• Graphs, hypergraphs, and properads
• scientific article; zbMATH DE number 53892
• Hyperfinite graphings and combinatorial optimization
• Scheduling Problems and Mixed Graph Colorings

Cited in

(15)

• An existential problem of a weight-controlled subset and its application to school timetable construction
• Chromatic optimisation: Limitations, objectives, uses, references
• The combinatorics of timetabling
• Linear combinations of heuristics for examination timetabling
• Asymmetric decomposability and persegram representation in coherent conditional probability theory
• A graph-based hyper-heuristic for educational timetabling problems
• An application of edge coloring of graphs to a class scheduling problem
• Graph theory applied in school schedule network
• scientific article; zbMATH DE number 3867045 (Why is no real title available?)
• scientific article; zbMATH DE number 3874960 (Why is no real title available?)
• Some uses of hypergraphs in timetabling
• Regular set of representatives for time-constrained MSC graphs
• The design and implementation of an interactive course-timetabling system
• ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS
• An introduction to timetabling

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686417)