An existential problem of a weight-controlled subset and its application to school timetable construction (Q1115806)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An existential problem of a weight-controlled subset and its application to school timetable construction |
scientific article; zbMATH DE number 4087441
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An existential problem of a weight-controlled subset and its application to school timetable construction |
scientific article; zbMATH DE number 4087441 |
Statements
An existential problem of a weight-controlled subset and its application to school timetable construction (English)
0 references
1988
0 references
We propose a new combinatorial problem including a school timetable problem and give some theoretical solutions. The problem seems very simple but general because it also includes a network flow problem, a graph coloring problem and some other combinatorial problems as a special case of it.
0 references
school timetable
0 references
network flow
0 references
graph coloring
0 references
0 references
0 references
