A branch-and-cut procedure for the Udine course timetabling problem (Q1761891): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57968679, #quickstatements; #temporary_batch_1712688784189 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57968679 / rank | |||
Normal rank | |||
Revision as of 21:03, 9 April 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
