A branch-and-cut procedure for the Udine course timetabling problem (Q1761891): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 01:22, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut procedure for the Udine course timetabling problem |
scientific article |
Statements
A branch-and-cut procedure for the Udine course timetabling problem (English)
0 references
15 November 2012
0 references
integer programming
0 references
branch-and-cut
0 references
cutting planes
0 references
soft constraints
0 references
educational timetabling
0 references
university course timetabling
0 references
