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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9178267/ |