| 2012 | ||
|---|---|---|
| j8 | Markus Triska, Nysret Musliu: An effective greedy heuristic for the Social Golfer Problem. Annals OR 194(1): 413-425 (2012) | |
| j7 | Markus Triska, Nysret Musliu: An improved SAT formulation for the social golfer problem. Annals OR 194(1): 427-438 (2012) | |
| c13 | Kadri Sylejmani, Jiirgen Dorn, Nysret Musliu: A Tabu Search approach for Multi Constrained Team Orienteering Problem and its application in touristic trip planning. HIS 2012: 300-305 | |
| c12 | Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. LION 2012: 130-144 | |
| c11 | Andreas Lehrbaum, Nysret Musliu: A New Hyperheuristic Algorithm for Cross-Domain Search Problems. LION 2012: 437-442 | |
| 2011 | ||
| c10 | Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: A New Tree-Decomposition Based Algorithm for Answer Set Programming. ICTAI 2011: 916-918 | |
| 2010 | ||
| j6 | Andreas Beer, Johannes Gärtner, Nysret Musliu, Werner Schafhauser, Wolfgang Slany: An AI-Based Break-Scheduling System for Supervisory Personnel. IEEE Intelligent Systems 25(2): 60-73 (2010) | |
| c9 | ||
| c8 | Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, Wolfgang Slany: A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem. Hybrid Metaheuristics 2010: 46-61 | |
| c7 | Magdalena Widl, Nysret Musliu: An Improved Memetic Algorithm for Break Scheduling. Hybrid Metaheuristics 2010: 133-147 | |
| 2008 | ||
| c6 | Artan Dermaku, Tobias Ganzow, Georg Gottlob, Benjamin J. McMahan, Nysret Musliu, Marko Samer: Heuristic Methods for Hypertree Decomposition. MICAI 2008: 1-11 | |
| p1 | Nysret Musliu: An Iterative Heuristic Algorithm for Tree Decomposition. Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 133-150 | |
| 2007 | ||
| j5 | Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany: The minimum shift design problem. Annals OR 155(1): 79-105 (2007) | |
| c5 | ||
| 2006 | ||
| c4 | ||
| 2005 | ||
| c3 | Nysret Musliu: Combination of Local Search Strategies for Rotating Workforce Scheduling Problem. IJCAI 2005: 1529-1530 | |
| c2 | Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello: Hypertree Decompositions: Structure, Algorithms, and Applications. WG 2005: 1-15 | |
| 2004 | ||
| j4 | Nysret Musliu, Andrea Schaerf, Wolfgang Slany: Local search for shift design. European Journal of Operational Research 153(1): 51-64 (2004) | |
| 2003 | ||
| c1 | Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany: The Minimum Shift Design Problem: Theory and Practice. ESA 2003: 593-604 | |
| 2002 | ||
| j3 | Nysret Musliu, Johannes Gärtner, Wolfgang Slany: Efficient generation of rotating workforce schedules. Discrete Applied Mathematics 118(1-2): 85-98 (2002) | |
| 2001 | ||
| j2 | Johannes Gärtner, Nysret Musliu, Wolfgang Slany: Rota: a research project on algorithms for workforce scheduling and shift design optimization. AI Commun. 14(2): 83-92 (2001) | |
| j1 | Ruth Fingerlos, Johannes Gärtner, Nysret Musliu, Wolfgang Slany: Zyklische Schichtplanung. KI 15(2): 31-34 (2001) | |
Colors in the list of coauthors
Last update Tue May 21 23:27:34 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page