A Convex LASSO Framework for Linear Timetabling
A new convex optimization framework for approximately solving timetabling problems that can be described as integer linear programs is proposed.The method is based on converting the timetabling problem into a cardinality constrained problem while viewing the operational constraints of the timetable as noisy measurements with an unknown average slac