MaxSAT-based large neighborhood search for high school timetabling
Year of publication: |
February
|
---|---|
Authors: | Demirović, Emir ; Musliu, Nysret |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 78.2017, p. 172-180
|
Subject: | Max | SATHigh school timetabling | Large neighborhood search | Local search | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory | Nachbarschaft | Neighbourhood |
-
Split-merge : using exponential neighborhood search for scheduling a batching machine
Cabo, Marta, (2015)
-
He, Jieguang, (2016)
-
A large neighborhood search approach for the paint shop scheduling problem
Winter, Felix, (2022)
- More ...
-
Modeling high school timetabling with bitvectors
Demirović, Emir, (2017)
-
Genetic algorithms for generalised hypertree decompositions
Musliu, Nysret, (2007)
-
An improved SAT formulation for the Social Golfer Problem
Triska, Markus, (2012)
- More ...