Abstract
We study the facial structure of polyhedra associated with the classical class-teacher time-table problem. After the presentation of some first results we introduce the class of partition inequalities and show that they are facet-defining for the general, monotone time-table polyhedron. Then we show that for two classes, two teachers and an arbitrary number of time periods, the time-table problem can be solved by the greedy algorithm. A polyhedral description for the associated monotone polytope is given based on nonnegativity, assignment and partition inequalities. The completeness of the linear system is established via the concept of total dual integrality. Finally, we conclude with some open questions and related problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
