.png){kind=icon}
Return
The lecture-hall quadratic assignment problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2026.107659.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
•
A lecture-hall QAP is isolated for post-timetabling hall assignment.
•
Sparse successor graphs do not remove QAP-level hardness.
•
Biclique distance cuts strengthen compact MIP formulations.
•
Biclique-strengthened MIP proves all 35 instances optimal within 1800 s.
•
Optimized rooms cut model-implied Lancaster walking by 20%–45%.
Keywords:
Lecture-hall assignment
Quadratic assignment problem
University course timetabling
Interval scheduling
Mixed-integer programming
Biclique inequalities
Journal
C
IF:
4.3
Papers:
211
Citations:
0
Organization
No organization information available
Cited Papers
No cited papers available