Nysret Musliu
TitleCited byYear
Local search for shift design
N Musliu, A Schaerf, W Slany
European journal of operational research 153 (1), 51-64, 2004
982004
Efficient generation of rotating workforce schedules
N Musliu, J Gärtner, W Slany
Discrete Applied Mathematics 118 (1-2), 85-98, 2002
882002
Heuristic methods for hypertree decomposition
A Dermaku, T Ganzow, G Gottlob, B McMahan, N Musliu, M Samer
Mexican International Conference on Artificial Intelligence, 1-11, 2008
782008
Hypertree decompositions: Structure, algorithms, and applications
G Gottlob, M Grohe, N Musliu, M Samer, F Scarcello
International Workshop on Graph-Theoretic Concepts in Computer Science, 1-15, 2005
762005
Local search algorithm for unicost set covering problem
N Musliu
International Conference on Industrial, Engineering and Other Applications …, 2006
542006
XHSTT: an XML archive for high school timetabling problems in different countries
G Post, JH Kingston, S Ahmadi, S Daskalaki, C Gogos, J Kyngas, C Nurmi, ...
Annals of Operations Research 218 (1), 295-301, 2014
442014
The minimum shift design problem
L Di Gaspero, J Gärtner, G Kortsarz, N Musliu, A Schaerf, W Slany
Annals of operations research 155 (1), 79-105, 2007
442007
Rota: a research project on algorithms for workforce scheduling and shift design optimization
J Gärtner, N Musliu, W Slany
AI Communications 14 (2), 83-92, 2001
442001
Combination of local search strategies for rotating workforce scheduling problem
N Musliu
IJCAI 2005: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE 19 …, 2005
43*2005
A tabu search approach for multi constrained team orienteering problem and its application in touristic trip planning
K Sylejmani, J Dorn, N Musliu
2012 12th International Conference on Hybrid Intelligent Systems (HIS), 300-305, 2012
272012
The break scheduling problem: complexity results and practical algorithms
M Widl, N Musliu
Memetic Computing 6 (2), 97-112, 2014
26*2014
Improving the efficiency of dynamic programming on tree decompositions via machine learning
M Abseher, N Musliu, S Woltran
Journal of Artificial Intelligence Research 58, 829-858, 2017
242017
htd–a free, open-source framework for (customized) tree decompositions and beyond
M Abseher, N Musliu, S Woltran
International Conference on AI and OR Techniques in Constraint Programming …, 2017
22*2017
An AI-based break-scheduling system for supervisory personnel
A Beer, J Gartner, N Musliu, W Schafhauser, W Slany
IEEE Intelligent Systems 25 (2), 60-73, 2010
222010
Application of machine learning to algorithm selection for TSP
J Pihera, N Musliu
2014 IEEE 26th International Conference on Tools with Artificial …, 2014
202014
A hybrid LS-CP solver for the shifts and breaks design problem
L Di Gaspero, J Gärtner, N Musliu, A Schaerf, W Schafhauser, W Slany
International Workshop on Hybrid Metaheuristics, 46-61, 2010
202010
Scheduling breaks in shift plans for call centers
A Beer, J Gärtner, N Musliu, W Schafhauser, W Slany
Proc. of the 7th Int. Conf. on the Practice and Theory of Automated …, 2008
202008
Algorithm selection for the graph coloring problem
N Musliu, M Schwengerer
International Conference on Learning and Intelligent Optimization, 389-403, 2013
192013
A CSP hypergraph library
T Ganzow, G Gottlob, N Musliu, M Samer
Technical Report, DBAI-TR-2005-50, Technische Universitt Wien, 2005
18*2005
Genetic algorithms for generalized hypertree decompositions
N Musliu, W Schafhauser
European Journal of Industrial Engineering 1 (3), 317-340, 2007
162007
The system can't perform the operation now. Try again later.
Articles 1–20