An existential problem of a weight-controlled subset and its application to school timetable construction (Q1115806)

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.