Timetabling problems at the TU Eindhoven

DOI10.1016/j.endm.2006.06.057zbMath1134.90563OpenAlexW2897574386MaRDI QIDQ5899383

John van den Broek, Gerhard J. Woeginger, Cor A. J. Hurkens

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.057

zbMATH Keywords

NP-completenessuniversity timetablinginteger programming formulationnetwork flow formulation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Matching models (91B68)

Related Items (1)

A university-timetabling problem and its solution using Benders' partitioning---a case study

This page was built for publication: Timetabling problems at the TU Eindhoven