scientific article; zbMATH DE number 3230852
From MaRDI portal
Publication:5518886
zbMath0143.18802MaRDI QIDQ5518886
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Improved edge-coloring with three colors, A complexity analysis and an algorithmic approach to student sectioning in existing timetables, A two-stage decomposition of high school timetabling applied to cases in Denmark, An existential problem of a weight-controlled subset and its application to school timetable construction, Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem, Dual criteria preemptive open-shop problems with minimum makespan, Timetable construction: the algorithms and complexity perspective, Construction of university faculty timetables using logic programming techniques, Decomposition of university course timetabling. A systematic study of subproblems and their complexities, A column generation approach to high school timetabling modeled as a multicommodity flow problem, Integer programming techniques for educational timetabling, Strong bounds with cut and column generation for class-teacher timetabling, Mathematical programming models and algorithms for a class--faculty assignment problem, Facets of the three-index assignment polytope, A Boolean matrix iteration in timetable construction, Scheduling with list processing and problem oriented data structures. An itinerant teacher example, Erfahrungen beim Einsatz eines Computers zur Stundenplanherstellung, A heuristic approach to algorithms intended for the solution of the timetable-problem, An introduction to timetabling, Polynomial reduction of time-space scheduling to time scheduling, Using euler partitions to edge color bipartite multigraphs, A SA-VNS approach for the High School Timetabling Problem, A generalized class-teacher model for some timetabling problems, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
