Nysret Musliu
Associate Prof. Dipl.-Ing. Dr.techn.
Research Focus
- Logic and Computation: 100%
Research Areas
- Search methods in AI, Heuristic Methods, Constraint Satisfaction, Machine Learning and Optimization, Scheduling and Timetabling, Problem solving
Role
-
Associate Professor
Databases and Artificial Intelligence, E192-02
Courses
2024W
- Bachelor Thesis / 184.691 / PR
- Doctoral & Master Students Seminar / 181.223 / SE
- Interdisciplinary Project in Data Science / 194.147 / PR
- Introduction to Machine Learning / 194.025 / VU
- IT Projects for Youth / 192.055 / PR
- IT Projects for Youth / 192.058 / UE
- Machine Learning / 184.702 / VU
- Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
- Project in Computer Science 1 / 192.021 / PR
- Project in Computer Science 2 / 192.022 / PR
- Sustainability in Computer Science / 194.155 / VU
2025S
- IT Projects for Youth / 192.055 / PR
- IT Projects for Youth / 192.058 / UE
- Machine Learning / 184.702 / VU
- Project in Computer Science 1 / 192.021 / PR
- Project in Computer Science 2 / 192.022 / PR
Projects
-
Reverse supply chain of residual wood biomass
2022 – 2026 / FWF - Österr. Wissenschaftsfonds -
AI-driven collaborative supply and demand matching platform for food waste reduction in the perishable food supply chain
2022 – 2025 / Austrian Research Promotion Agency (FFG) -
Automated Examination Timetabling in the Faculty of Electrical and Computer Engineering - University of Prishtina
2021 – 2023 / Federal Ministry of Science, Research and Economy (bm:wfw) -
Predictive Analytics for Emergency Call Infrastructure
2019 – 2022 / Austrian Research Promotion Agency (FFG)
Publication: 58615 -
Systemübergreifende Steuerung von Transport- und Intralogistik zur nachhaltigen Distribution im Physical Internet
2019 – 2022 / Austrian Research Promotion Agency (FFG) -
Selbstlernende Prognose kapazitiver Aufwände zur Sicherung der Materialver- und -entsorgung komplexer Produktionssysteme
2018 – 2022 / Austrian Research Promotion Agency (FFG) -
Automated Curriculum-based Course Timetabling in the University
of Prishtina
2018 – 2020 / Federal Ministry of Science, Research and Economy (bm:wfw) -
CD Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling
2017 – 2024 / Christian Doppler Research Association (CDG)
Publications: 136808 / 139849 / 138379 / 138399 / 138400 / 138528 / 138530 / 144345 / 142199 / 142211 / 142210 / 142193 / 141227 / 141228 / 143220 / 143222 / 190688 / 191173 / 193566 / 192686 / 192678 / 24775 / 55565 / 55636 / 57470 / 57475 / 57476 / 57570 / 57572 / 57573 / 57872 / 57873 / 57874 / 57876 / 57878 / 57880 / 58293 / 58340 / 58583 / 58584 / 58585 / 58586 / 58590 / 58591 / 86907 / 87083 -
Artificial Intelligence in Employee Scheduling
2012 – 2017 / Austrian Science Fund (FWF)
Publications: 147243 / 147247 / 147248 / 147249 / 157902 / 28216 / 28570 / 29008 / 55072 / 55073 / 55080 / 55981 / 55982 / 55983 / 55984 / 56206 / 56216 / 56218 / 57105 / 57114 / 57115 / 57571 / 86010 / 86011 -
Theoretical Tractability vs. Practical Computation
2008 – 2012 / Austrian Science Fund (FWF)
Publications: 155421 / 155572 / 155810 / 163666 / 163667 / 167366 / 37126 / 52742 / 52743 / 52757 / 52759 / 52760 / 52762 / 52763 / 53134 / 53170 / 53671 / 53675 / 54154 / 54178 / 54179 / 54181 / 54202 / 54884 -
Softnet-Planungswissen
2006 – 2011 / Austrian Research Promotion Agency (FFG)
Publications: 51824 / 52808 / 52809 / 52810 / 52811 -
Complementary Approaches to Constraint Satisfaction
2004 – 2006 / Austrian Science Fund (FWF)
Publications: 169638 / 50997 / 51013 / 51014 / 51046 / 51362 / 51669 / 51799 / 51823
Publications
2024
- Adaptive large-neighbourhood search for optimisation in answer-set programming / Eiter, T., Geibinger, T., Higuera Ruiz, N. N., Musliu, N., Oetsch, J., Pfliegler, D., & Stepanova, D. (2024). Adaptive large-neighbourhood search for optimisation in answer-set programming. Artificial Intelligence, 337, Article 104230. https://doi.org/10.1016/j.artint.2024.104230
-
Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling
/
Geibinger, T., Mischek, F., & Musliu, N. (2024). Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling. Journal of Scheduling. https://doi.org/10.1007/s10951-024-00821-0
Project: ARTIS (2017–2024) - Instance Space Analysis for the Bus Driver Scheduling Problem / Mannelli Mazzoli, T., Kletzander, L., Musliu, N., & Smith-Miles, K. (2024). Instance Space Analysis for the Bus Driver Scheduling Problem. In Proceedings of the 14th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2024 (pp. 20–35).
- Investigating Large Neighbourhood Search for Bus Driver Scheduling / Mazzoli, T. M., Kletzander, L., Van Hentenryck, P., & Musliu, N. (2024). Investigating Large Neighbourhood Search for Bus Driver Scheduling. In S. Bernardini & C. Muise (Eds.), Vol. 34 (2024): Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling (pp. 360–368). AAAI Press. https://doi.org/10.1609/icaps.v34i1.31495
2023
-
Leveraging problem-independent hyper-heuristics for real-world test laboratory scheduling
/
Mischek, F., & Musliu, N. (2023). Leveraging problem-independent hyper-heuristics for real-world test laboratory scheduling. In GECCO ’23: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 321–329). Association for Computing Machinery (ACM). https://doi.org/10.1145/3583131.3590354
Download: PDF (599 KB)
Project: ARTIS (2017–2024) -
Dynamic Weight Setting for Personnel Scheduling with Many Objectives
/
Kletzander, L., & Musliu, N. (2023). Dynamic Weight Setting for Personnel Scheduling with Many Objectives. In S. Koenig, R. Stern, & M. Vallati (Eds.), Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (pp. 509–517). AAAI Press. https://doi.org/10.1609/icaps.v33i1.27231
Download: All rights reserved (152 KB)
Project: ARTIS (2017–2024) -
Large-State Reinforcement Learning for Hyper-Heuristics
/
Kletzander, L., & Musliu, N. (2023). Large-State Reinforcement Learning for Hyper-Heuristics. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (pp. 12444–12452). AAAI Press. https://doi.org/10.1609/aaai.v37i10.26466
Download: All rights reserved (134 KB)
Project: ARTIS (2017–2024) -
Exact methods for the Oven Scheduling Problem
/
Lackner, M.-L., Mrkvicka, C., Musliu, N., Walkiewicz, D., & Winter, F. (2023). Exact methods for the Oven Scheduling Problem. Constraints, 28(2), 320–361. https://doi.org/10.1007/s10601-023-09347-2
Download: PDF (731 KB)
Project: ARTIS (2017–2024) - Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling / EITER, T., GEIBINGER, T., MUSLIU, N., OETSCH, J., SKOČOVSKÝ, P., & STEPANOVA, D. (2023). Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. Theory and Practice of Logic Programming, 23(6), 1281–1306. https://doi.org/10.1017/S1471068423000017
2022
- ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (Extended Abstract) / Eiter, T., Geibinger, T., Higuera, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (Extended Abstract). In Proceedings of the 5th Workshop on Trends and Applications of Answer Set Programming. 5th Workshop on Trends and Applications of Answer Set Programming, Vienna, Austria.
- Large-Neighbourhood Search for Optimisation in Answer-Set Solving (Extended Abstract) / Eiter, T., Geibinger, T., Higuera Ruiz, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). Large-Neighbourhood Search for Optimisation in Answer-Set Solving (Extended Abstract). In Proceedings of the 38th International Conference on Logic Programming. 38th International Conference on Logic Programming, Haifa, Israel. Open Publishing Association. http://hdl.handle.net/20.500.12708/139851
- A System for Automated Industrial Test Laboratory Scheduling / Danzinger, P., Geibinger, T., Janneau, D., Mischek, F., Musliu, N., & Poschalko, C. (2022). A System for Automated Industrial Test Laboratory Scheduling. ACM Transactions on Intelligent Systems and Technology. https://doi.org/10.1145/3546871
-
Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
/
Winter, F., Meiswinkel, S., Musliu, N., & Walkiewicz, D. (2022). Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry. In 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel (pp. 1–18). https://doi.org/10.4230/LIPIcs.CP.2022.41
Download: PDF (859 KB)
Project: ARTIS (2017–2024) - Metaheuristic algorithms for the bus driver scheduling problem with complex break constraints / Kletzander, L., Mazzoli, T. M., & Musliu, N. (2022). Metaheuristic algorithms for the bus driver scheduling problem with complex break constraints. In GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 232–240). https://doi.org/10.1145/3512290.3528876
- Investigating Hyper-heuristics for Real-World Test Laboratory Scheduling / Mischek, F., & Musliu, N. (2022, July 0). Investigating Hyper-heuristics for Real-World Test Laboratory Scheduling [Conference Presentation]. EURO 2022, Espoo, Finland.
- Reinforcement Learning for Cross-Domain Hyper-Heuristics / Mischek, F., & Musliu, N. (2022). Reinforcement Learning for Cross-Domain Hyper-Heuristics. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 4793–4799). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/664
- Large-Neighbourhood Search for Optimisation in Answer-Set Solving / Eiter, T., Geibinger, T., Higuera Ruiz, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). Large-Neighbourhood Search for Optimisation in Answer-Set Solving. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 5616–5625). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20502
- An Open Challenge for Exact Job Scheduling with Reticle Batching in Photolithography / Eiter, T., Geibinger, T., Gisbrecht, A., Higuera Ruiz, N. N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). An Open Challenge for Exact Job Scheduling with Reticle Batching in Photolithography. In KEPS 2022 Workshop on Knowledge Engineering for Planning and Scheduling. Workshop on Knowledge Engineering for Planning and Scheduling, Singapore. http://hdl.handle.net/20.500.12708/139763
-
Hyper-Heuristics for Personnel Scheduling Domains
/
Kletzander, L., & Musliu, N. (2022). Hyper-Heuristics for Personnel Scheduling Domains. In Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (pp. 462–470). AAAI Press. https://doi.org/10.1609/icaps.v32i1.19832
Project: ARTIS (2017–2024) -
Exact and meta-heuristic approaches for the production leveling problem
/
Vass, J., Lackner, M.-L., Mrkvicka, C., Musliu, N., & Winter, F. (2022). Exact and meta-heuristic approaches for the production leveling problem. Journal of Scheduling, 25(3), 339–370. https://doi.org/10.1007/s10951-022-00721-1
Download: PDF (1.5 MB)
Project: ARTIS (2017–2024) -
An Investigation of Hyper-Heuristic Approaches for Teeth Scheduling
/
Winter, F., & Musliu, N. (2022). An Investigation of Hyper-Heuristic Approaches for Teeth Scheduling. In MIC 2022: 14th Metaheuristics International Conference. 14th Metaheuristics International Conference (MIC 2022), Ortigia-Syracuse, Italy. Springer.
Project: ARTIS (2017–2024) - ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser / Eiter, T., Geibinger, T., Higuera, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser. In G. Kern-Isberner, G. Lackemeyer, & T. Meyer (Eds.), Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning — Applications and Systems (pp. 565–569). IJCAI Organization. https://doi.org/10.24963/kr.2022/58
-
Modeling and Solving the K-track Assignment Problem
/
Preininger, J., Winter, F., & Musliu, N. (2022). Modeling and Solving the K-track Assignment Problem. In 14th Metaheuristics International Conference. MIC 2022 - 14th Metaheuristics International Conference, Ortigia-Syracuse, Italy. Springer. http://hdl.handle.net/20.500.12708/142199
Project: ARTIS (2017–2024) -
A Hybrid Approach for Paint Shop Scheduling in the Automotive Supply Industry
/
Winter, F., & Musliu, N. (2022). A Hybrid Approach for Paint Shop Scheduling in the Automotive Supply Industry. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 317–320). http://hdl.handle.net/20.500.12708/142193
Project: ARTIS (2017–2024) -
Solving the Production Leveling Problem with Order-Splitting and Resource Constraints
/
Vass, J., Musliu, N., & Winter, F. (2022). Solving the Production Leveling Problem with Order-Splitting and Resource Constraints. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 261–284). http://hdl.handle.net/20.500.12708/142211
Project: ARTIS (2017–2024) -
Solving an Industrial Oven Scheduling Problem with a Simulated Annealing Approach
/
Lackner, M.-L., Musliu, N., & Winter, F. (2022). Solving an Industrial Oven Scheduling Problem with a Simulated Annealing Approach. In Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (pp. 115–120). http://hdl.handle.net/20.500.12708/142210
Project: ARTIS (2017–2024)
2021
-
Instance space analysis for a personnel scheduling problem
/
Kletzander, L., Musliu, N., & Smith-Miles, K. (2021). Instance space analysis for a personnel scheduling problem. Annals of Mathematics and Artificial Intelligence, 89(7), 617–637. https://doi.org/10.1007/s10472-020-09695-2
Download: PDF (4.52 MB)
Project: ARTIS (2017–2024) -
A local search framework for industrial test laboratory scheduling
/
Mischek, F., & Musliu, N. (2021). A local search framework for industrial test laboratory scheduling. Annals of Operations Research, 302, 533–562. https://doi.org/10.1007/s10479-021-04007-1
Download: PDF (477 KB) -
Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem
/
Lackner, M.-L., Mrkvicka, C., Musliu, N., Walkiewicz, D., & Winter, F. (2021). Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem. In 27th International Conference on Principles and Practice of Constraint Programming, {CP} 2021, Montpellier, France (Virtual Conference), October 25-29, 2021} (pp. 37:1-37:18). https://doi.org/10.4230/LIPIcs.CP.2021.37
Project: ARTIS (2017–2024) -
Automated configuration of parallel machine dispatching rules by machine learning
/
Faustmann, G., Mrkvicka, C., Musliu, N., & Winter, F. (2021). Automated configuration of parallel machine dispatching rules by machine learning. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO 2021 - Genetic and Evolutionary Computation Conference, Companion Volume, Lille, France. https://doi.org/10.1145/3449726.3459541
Project: ARTIS (2017–2024) -
Solving the paintshop scheduling problem with memetic algorithms
/
Musliu, N., Weintritt, W., & Winter, F. (2021). Solving the paintshop scheduling problem with memetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference. GECCO 2021 - Genetic and Evolutionary Computation Conference, Companion Volume, Lille, France. https://doi.org/10.1145/3449639.3459375
Project: ARTIS (2017–2024) -
Automated Production Scheduling for Artificial Teeth Manufacturing
/
Mrkvicka, C., Musliu, N., Preininger, J., & Winter, F. (2021). Automated Production Scheduling for Artificial Teeth Manufacturing. In Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, {ICAPS} 2021, Guangzhou, China (virtual), August 2-13, 2021}, (pp. 500–508). http://hdl.handle.net/20.500.12708/58583
Project: ARTIS (2017–2024) -
Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling
/
Eiter, T., Geibinger, T., Musliu, N., Oetsch, J., Skočovský, P., & Stepanova, D. (2021). Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, Unknown. https://doi.org/10.24963/kr.2021/27
Project: KIRAS-PrEMI (2019–2022) -
Constraint Logic Programming for Real-World Test Laboratory Scheduling
/
Geibinger, T., Mischek, F., & Musliu, N. (2021). Constraint Logic Programming for Real-World Test Laboratory Scheduling. In 35th AAAI Conference on Artificial Intelligence (pp. 6358–6366). http://hdl.handle.net/20.500.12708/58591
Project: ARTIS (2017–2024) -
Branch and Price for Bus Driver Scheduling with Complex Break Constraints
/
Kletzander, L., Musliu, N., & Van Hentenryck, P. (2021). Branch and Price for Bus Driver Scheduling with Complex Break Constraints. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9, 2021 (pp. 11853–11861). http://hdl.handle.net/20.500.12708/58590
Project: ARTIS (2017–2024) - Preface: The practice and theory of automated timetabling (2018) / Özcan, E., Burke, E., Di Gaspero, L., MCCollum, B., & Musliu, N. (2021). Preface: The practice and theory of automated timetabling (2018). Annals of Operations Research, 302(2), 339–340. https://doi.org/10.1007/s10479-021-04117-w
-
Exact and metaheuristic approaches for unrelated parallel machine scheduling
/
Moser, M., Musliu, N., Schaerf, A., & Winter, F. (2021). Exact and metaheuristic approaches for unrelated parallel machine scheduling. Journal of Scheduling, 25(5), 507–534. https://doi.org/10.1007/s10951-021-00714-6
Project: ARTIS (2017–2024) -
A large neighborhood search approach for the paint shop scheduling problem
/
Winter, F., & Musliu, N. (2021). A large neighborhood search approach for the paint shop scheduling problem. Journal of Scheduling, 25(4), 453–475. https://doi.org/10.1007/s10951-021-00713-7
Project: ARTIS (2017–2024) - Local search approaches for the test laboratory scheduling problem with variable task grouping / Mischek, F., Musliu, N., & Schaerf, A. (2021). Local search approaches for the test laboratory scheduling problem with variable task grouping. Journal of Scheduling. https://doi.org/10.1007/s10951-021-00699-2
- Algorithm selection and instance space analysis for curriculum-based course timetabling / De Coster, A., Musliu, N., Schaerf, A., Schoisswohl, J., & Smith-Miles, K. (2021). Algorithm selection and instance space analysis for curriculum-based course timetabling. Journal of Scheduling, 25(1), 35–58. https://doi.org/10.1007/s10951-021-00701-x
-
A local search framework for industrial test laboratory scheduling
/
Mischek, F., & Musliu, N. (2021). A local search framework for industrial test laboratory scheduling. Annals of Operations Research, 302(2), 533–562. https://doi.org/10.1007/s10479-021-04007-1
Project: ARTIS (2017–2024) -
Constraint-based Scheduling for Paint Shops in the Automotive Supply Industry
/
Winter, F., & Musliu, N. (2021). Constraint-based Scheduling for Paint Shops in the Automotive Supply Industry. ACM Transactions on Intelligent Systems and Technology, 12(2), 1–25. https://doi.org/10.1145/3430710
Project: ARTIS (2017–2024) -
Physician Scheduling During a Pandemic
/
Geibinger, T., Kletzander, L., Krainz, M., Mischek, F., Musliu, N., & Winter, F. (2021). Physician Scheduling During a Pandemic. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 456–465). https://doi.org/10.1007/978-3-030-78230-6_29
Project: ARTIS (2017–2024)
2020
-
Explaining Propagators for String Edit Distance Constraints
/
Musliu, N., Winter, F., & Stuckey, P. J. (2020). Explaining Propagators for String Edit Distance Constraints. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 1676–1683). https://doi.org/10.1609/aaai.v34i02.5530
Project: ARTIS (2017–2024) -
Solving the Test Laboratory Scheduling Problem with Variable Task Grouping
/
Danzinger, P., Geibinger, T., Mischek, F., & Musliu, N. (2020). Solving the Test Laboratory Scheduling Problem with Variable Task Grouping. In Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling (pp. 357–365). http://hdl.handle.net/20.500.12708/58340
Project: ARTIS (2017–2024) -
Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break Constraints
/
Kletzander, L., & Musliu, N. (2020). Solving Large Real-Life Bus Driver Scheduling Problems with Complex Break Constraints. In Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, Nancy, France, October 26-30, 2020 (pp. 421–430). http://hdl.handle.net/20.500.12708/55565
Project: ARTIS (2017–2024) - Introduction to the CPAIOR 2020 fast track issue / Hebrard, E., & Musliu, N. (2020). Introduction to the CPAIOR 2020 fast track issue. Constraints, 25(3–4), 298–299. https://doi.org/10.1007/s10601-020-09319-w
-
Solving the general employee scheduling problem
/
Kletzander, L., & Musliu, N. (2020). Solving the general employee scheduling problem. Computers and Operations Research, 113(104794), 104794. https://doi.org/10.1016/j.cor.2019.104794
Project: ARTIS (2017–2024) -
Instance space analysis for a personnel scheduling problem
/
Kletzander, L., Musliu, N., & Smith-Miles, K. (2020). Instance space analysis for a personnel scheduling problem. Annals of Mathematics and Artificial Intelligence, 89(7), 617–637. https://doi.org/10.1007/s10472-020-09695-2
Project: ARTIS (2017–2024) -
Integration of Constraint Programming, Artificial Intelligence, and Operations Research
/
Hebrard, E., & Musliu, N. (Eds.). (2020). Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Springer. https://doi.org/10.1007/978-3-030-58942-4
Project: ARTIS (2017–2024)
2019
-
Solving the Torpedo Scheduling Problem
/
Geiger, M. J., Kletzander, L., & Musliu, N. (2019). Solving the Torpedo Scheduling Problem. Journal of Artificial Intelligence Research, 66, 1–32. https://doi.org/10.1613/jair.1.11303
Project: ARTIS (2017–2024) -
Modelling and Solving the Minimum Shift Design Problem
/
Kletzander, L., & Musliu, N. (2019). Modelling and Solving the Minimum Shift Design Problem. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings. CPAIOR 2019 - 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research, Thessaloniki, Greece. Springer. https://doi.org/10.1007/978-3-030-19212-9_26
Project: ARTIS (2017–2024) -
Instance Space Analysis for a Personnel Scheduling Problem
/
Kletzander, L., Musliu, N., & Smith-Miles, K. (2019). Instance Space Analysis for a Personnel Scheduling Problem. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI} 2019 (pp. 1–8). http://hdl.handle.net/20.500.12708/57880
Project: ARTIS (2017–2024) -
Solution Approaches for an Automotive Paint Shop Scheduling Problem
/
Winter, F., Musliu, N., Mrkvicka, C., & Demirovic, E. (2019). Solution Approaches for an Automotive Paint Shop Scheduling Problem. In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, {ICAPS} 2019 (pp. 573–581). AAAI Press. http://hdl.handle.net/20.500.12708/57874
Project: ARTIS (2017–2024) -
Exact Methods for Extended Rotating Workforce Scheduling Problems
/
Kletzander, L., Musliu, N., Gärtner, J., Krennwallner, J., & Schafhauser, W. (2019). Exact Methods for Extended Rotating Workforce Scheduling Problems. In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, {ICAPS} 2018, Berkeley, CA, USA, July 11-15, 2019 (pp. 519–527). AAAI Press. http://hdl.handle.net/20.500.12708/57873
Project: ARTIS (2017–2024) -
Exact Methods for a Paint Shop Scheduling Problem from the Automotive Supply Industry
/
Winter, F., & Musliu, N. (2019). Exact Methods for a Paint Shop Scheduling Problem from the Automotive Supply Industry. CPAIOR 2019 - 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research, Thessaloniki, Greece. http://hdl.handle.net/20.500.12708/86907
Project: ARTIS (2017–2024) -
Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling
/
Geibinger, T., Mischek, F., & Musliu, N. (2019). Investigating Constraint Programming for Real World Industrial Test Laboratory Scheduling. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 304–319). Springer. https://doi.org/10.1007/978-3-030-19212-9_20
Project: ARTIS (2017–2024) - Modeling and solving staff scheduling with partial weighted maxSAT / Demirovic, E., Musliu, N., & Winter, F. (2019). Modeling and solving staff scheduling with partial weighted maxSAT. Annals of Operations Research, 275(1), 79–99. https://doi.org/10.1007/s10479-017-2693-y
-
Integer programming model extensions for a multi-stage nurse rostering problem
/
Mischek, F., & Musliu, N. (2019). Integer programming model extensions for a multi-stage nurse rostering problem. Annals of Operations Research. https://doi.org/10.1007/s10479-017-2623-z
Project: ARTIS (2017–2024)
2018
-
Modeling and Solving an Automotive Paint Shop Scheduling Problem
/
Winter, F., Musliu, N., Demirovic, E., & Mrkvicka, C. (2018). Modeling and Solving an Automotive Paint Shop Scheduling Problem. In 12th International Conference on the Practice and Theory of Automated Timetabling (pp. 477–480). http://hdl.handle.net/20.500.12708/57476
Project: ARTIS (2017–2024) -
Paint Shop Scheduling in the Automotive Supply Industry
/
Winter, F., Musliu, N., Demirovic, E., & Mrkvicka, C. (2018). Paint Shop Scheduling in the Automotive Supply Industry. In 29th European Conference on Operational Research (p. 161). http://hdl.handle.net/20.500.12708/57470
Project: ARTIS (2017–2024) -
Solution-Based Phase Saving and MaxSAT for Employee Scheduling: A Computational Study
/
Winter, F., Musliu, N., Demirovic, E., & Stuckey, P. J. (2018). Solution-Based Phase Saving and MaxSAT for Employee Scheduling: A Computational Study. In 12th International Conference on the Practice and Theory of Automated Timetabling (pp. 453–457). http://hdl.handle.net/20.500.12708/57475
Project: ARTIS (2017–2024) -
Min-conflicts heuristic for multi-mode resource-constrained projects scheduling
/
Musliu, N., & Ahmeti, A. (2018). Min-conflicts heuristic for multi-mode resource-constrained projects scheduling. In Proceedings of the Genetic and Evolutionary Computation Conference. GECCO: Genetic and Evolutionary Computation Conference, Seattle, Non-EU. ACM. https://doi.org/10.1145/3205455.3205620
Project: ARTIS (2017–2024) -
Solving the General Employee Scheduling Problem
/
Kletzander, L., & Musliu, N. (2018). Solving the General Employee Scheduling Problem. In 12th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2018 (pp. 1–36). http://hdl.handle.net/20.500.12708/57573
Project: ARTIS (2017–2024) -
A Local Search Framework for Industrial Test Laboratory Scheduling
/
Mischek, F., & Musliu, N. (2018). A Local Search Framework for Industrial Test Laboratory Scheduling. In Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2018) (pp. 465–467). http://hdl.handle.net/20.500.12708/57572
Project: ARTIS (2017–2024) -
Solver Independent Rotating Workforce Scheduling
/
Musliu, N., Schutt, A., & Stuckey, P. J. (2018). Solver Independent Rotating Workforce Scheduling. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 429–445). Springer. https://doi.org/10.1007/978-3-319-93031-2_31
Project: ARTE (2012–2017)
2017
-
Modeling high school timetabling with bitvectors
/
Demirović, E., & Musliu, N. (2017). Modeling high school timetabling with bitvectors. Annals of Operations Research. https://doi.org/10.1007/s10479-016-2220-6
Download: PDF (465 KB) -
htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond
/
Abseher, M., Musliu, N., & Woltran, S. (2017). htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. In D. Salvagnin & M. Lombardi (Eds.), Integration of AI and OR Techniques in Constraint Programming (pp. 376–386). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-59776-8_30
Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022) - Planning the trip itinerary for tourist groups / Sylejmani, K., Dorn, J., & Musliu, N. (2017). Planning the trip itinerary for tourist groups. Information Technology and Tourism, 17(3), 275–314. https://doi.org/10.1007/s40558-017-0080-9
-
Modeling and solving a real-life multi-skill shift design problem
/
Bonutti, A., Ceschia, S., De Cesco, F., Musliu, N., & Schaerf, A. (2017). Modeling and solving a real-life multi-skill shift design problem. Annals of Operations Research, 252(2), 365–382. https://doi.org/10.1007/s10479-016-2175-7
Project: ARTE (2012–2017) -
Personnel Scheduling as Satisfiability Modulo Theories
/
Erkinger, C., & Musliu, N. (2017). Personnel Scheduling as Satisfiability Modulo Theories. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. ijcai.org. https://doi.org/10.24963/ijcai.2017/86
Project: ARTE (2012–2017) -
A Hybrid Approach for the Sudoku Problem: Using Constraint Programming in Iterated Local Search
/
Musliu, N., & Winter, F. (2017). A Hybrid Approach for the Sudoku Problem: Using Constraint Programming in Iterated Local Search. IEEE Intelligent Systems, 32(2), 52–62. https://doi.org/10.1109/mis.2017.29
Project: ARTE (2012–2017) -
MaxSAT-based large neighborhood search for high school timetabling
/
Demirović, E., & Musliu, N. (2017). MaxSAT-based large neighborhood search for high school timetabling. Computers and Operations Research, 78, 172–180. https://doi.org/10.1016/j.cor.2016.08.004
Project: ARTE (2012–2017) -
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
/
Abseher, M., Musliu, N., & Woltran, S. (2017). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. Journal of Artificial Intelligence Research, 58, 829–858. https://doi.org/10.1613/jair.5312
Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022) - A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search / Taghizadeh, G., & Musliu, N. (2017). A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search. In B. Hu & M. López-Ibáñez (Eds.), Evolutionary Computation in Combinatorial Optimization (pp. 30–43). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-55453-2_3
-
A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem
/
Kletzander, L., & Musliu, N. (2017). A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem. In Integration of AI and OR Techniques in Constraint Programming (pp. 344–358). Lecture Notes in Computer Science (LNCS) / Springer. https://doi.org/10.1007/978-3-319-59776-8_28
Project: ARTE (2012–2017)
2016
- Feature Extractors for Describing Vehicle Routing Problem Instances / Rasku, J., Musliu, N., & Kärkkäinen, T. (2016). Feature Extractors for Describing Vehicle Routing Problem Instances. In 5th Student Conference on Operational Research (SCOR 2016) (p. 13). http://hdl.handle.net/20.500.12708/56917
-
Shift Design with Answer Set Programming
/
Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2016). Shift Design with Answer Set Programming. Fundamenta Informaticae, 147(1), 1–25. http://hdl.handle.net/20.500.12708/149520
Projects: D-Flat (2013–2017) / START (2014–2022) - Universities and computer science in the European crisis of refugees / Conrad, K., Musliu, N., Pichler, R., & Werthner, H. (2016). Universities and computer science in the European crisis of refugees. Communications of the ACM, 59(10), 31–33. https://doi.org/10.1145/2893180
- An Exact Algorithm for Unicost Set Covering / Demirovic, E., Le Calvar, T., Musliu, N., & Inoue, K. (2016). An Exact Algorithm for Unicost Set Covering. In Doctoral Program of the 22nd International Conference on the Principles and Practice of Constraint Programming (CP 2016) (p. 9). http://hdl.handle.net/20.500.12708/56918
- Modeling and solving staff scheduling with partial weighted maxSAT / Demirovic, E., Musliu, N., & Winter, F. (2016). Modeling and solving staff scheduling with partial weighted maxSAT. In PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling (p. 17). http://hdl.handle.net/20.500.12708/56872
- Integer Programming and Heuristic Approaches for a Multi-Stage Nurse Rostering Problem / Mischek, F., & Musliu, N. (2016). Integer Programming and Heuristic Approaches for a Multi-Stage Nurse Rostering Problem. In PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling (p. 18). http://hdl.handle.net/20.500.12708/56871
-
htd -- A Free, Open-Source Framework for Tree Decompositions and Beyond
/
Abseher, M., Musliu, N., & Woltran, S. (2016). htd -- A Free, Open-Source Framework for Tree Decompositions and Beyond (DBAI-TR-2016-96). http://hdl.handle.net/20.500.12708/39077
Project: START (2014–2022) -
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
/
Abseher, M., Musliu, N., & Woltran, S. (2016). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning (DBAI-TR-2016-94). http://hdl.handle.net/20.500.12708/39075
Project: START (2014–2022)
2015
-
Shift Design with Answer Set Programming
/
Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In D. Inclezan & M. Maratea (Eds.), 8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015 (p. 13). http://hdl.handle.net/20.500.12708/56218
Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022) -
Metaheuristic Algorithms and Tree Decomposition
/
Hammerl, T., Musliu, N., & Schafhauser, W. (2015). Metaheuristic Algorithms and Tree Decomposition. In J. Kacprzyk & W. Pedrycz (Eds.), Springer Handbook of Computational Intelligence (pp. 1255–1270). Springer. https://doi.org/10.1007/978-3-662-43505-2_64
Project: ARTE (2012–2017) -
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
/
Dusberger, F., Abseher, M., Musliu, N., & Woltran, S. (2015). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. In Q. Yang & M. Wooldridge (Eds.), Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence (pp. 275–282). AAAI Press. http://hdl.handle.net/20.500.12708/56206
Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022) -
Shift Design with Answer Set Programming
/
Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 32–39). Springer. https://doi.org/10.1007/978-3-319-23264-5_4
Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
2014
-
The break scheduling problem: complexity results and practical algorithms
/
Widl, M., & Musliu, N. (2014). The break scheduling problem: complexity results and practical algorithms. Memetic Computing, 6(2), 97–112. https://doi.org/10.1007/s12293-014-0131-0
Projects: ARTE (2012–2017) / Boolean (2011–2019) / FAME (2011–2014) -
Automating the Parameter Selection in VRP: An Off-line Parameter Tuning Tool Comparison
/
Rasku, J., Musliu, N., & Kärkkäinen, T. (2014). Automating the Parameter Selection in VRP: An Off-line Parameter Tuning Tool Comparison. In Modeling, Simulation and Optimization for Science and Technology. Computational Methods in Applied Sciences, Volume 34 (pp. 191–209). Springer Netherlands. http://hdl.handle.net/20.500.12708/28570
Project: ARTE (2012–2017) -
Automated Employee Scheduling
/
Musliu, N. (2014). Automated Employee Scheduling. SWORDS 2014 - Szeged WORkshop on Discrete Structures, Szeged, EU. http://hdl.handle.net/20.500.12708/86011
Project: ARTE (2012–2017) -
Scheduling Problems: Case Studies and Solution Techniques
/
Musliu, N. (2014). Scheduling Problems: Case Studies and Solution Techniques. International Conference on Automated Planning and Scheduling (ICAPS), Delft, EU. http://hdl.handle.net/20.500.12708/86010
Project: ARTE (2012–2017) -
Modeling and Solving a Real-Life Multi-Skill Shift Design Problem
/
Bonutti, A., De Cesco, F., Musliu, N., & Schaerf, A. (2014). Modeling and Solving a Real-Life Multi-Skill Shift Design Problem. In Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling (p. 3). http://hdl.handle.net/20.500.12708/55984
Project: ARTE (2012–2017) -
Solving High School Timetabling with Satisfiability Modulo Theories
/
Demirovic, E., & Musliu, N. (2014). Solving High School Timetabling with Satisfiability Modulo Theories. In Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling (p. 25). http://hdl.handle.net/20.500.12708/55983
Project: ARTE (2012–2017) -
Application of Machine Learning to Algorithm Selection for TSP
/
Pihera, J., & Musliu, N. (2014). Application of Machine Learning to Algorithm Selection for TSP. In 26th IEEE International Conference on Tools with Artificial Intelligence (pp. 47–54). http://hdl.handle.net/20.500.12708/55982
Project: ARTE (2012–2017) -
Modeling High School Timetabling as PartialWeighted maxSAT
/
Demirovic, E., & Musliu, N. (2014). Modeling High School Timetabling as PartialWeighted maxSAT. In The Proceedings of 4th Workshop on Logic and Search (a SAT / ICLP workshop at FLoC 2014) (p. 15). http://hdl.handle.net/20.500.12708/55981
Project: ARTE (2012–2017)
2013
-
Algorithm Selection for the Graph Coloring Problem
/
Musliu, N., & Schwengerer, M. (2013). Algorithm Selection for the Graph Coloring Problem. In Learning and Intelligent Optimization, 7th International Conference, LION 7 (pp. 389–403). Srringer. http://hdl.handle.net/20.500.12708/55073
Project: ARTE (2012–2017) -
Scheduling of electric vehicle charging operations
/
Bucar, D., Bessler, S., Musliu, N., & Grønbæk, J. (2013). Scheduling of electric vehicle charging operations. In Proceedings of MISTA 2013- Multidisciplinary International Scheduling Conference: Theory and Applications (pp. 1–13). http://hdl.handle.net/20.500.12708/55080
Project: ARTE (2012–2017) -
Automated Shift Design and Break Scheduling
/
Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2013). Automated Shift Design and Break Scheduling. In Automated Scheduling and Planning, Studies in Computational Intelligence Volume 505 (pp. 109–127). Springer. http://hdl.handle.net/20.500.12708/28216
Project: ARTE (2012–2017) - Automated Test Case Generation in End-User Programming / Musliu, N., Slany, W., & Gärtner, J. (2013). Automated Test Case Generation in End-User Programming. In End-User Development (pp. 272–277). Springer. http://hdl.handle.net/20.500.12708/55075
-
Applying Machine Learning for Solver Selection in Scheduling
/
Musliu, N. (2013). Applying Machine Learning for Solver Selection in Scheduling. In Proceedings of the 10th Metaheuristic International Conference (MIC 2013) (pp. 240–242). http://hdl.handle.net/20.500.12708/55072
Project: ARTE (2012–2017) - Analyzing the Features of Employee Scheduling Problems (abstract) / Musliu, N. (2013). Analyzing the Features of Employee Scheduling Problems (abstract). In XXVI EURO - INFORMS Joint International Conference, Abstracts (p. 1). http://hdl.handle.net/20.500.12708/55081
2012
- A Taboo Search approach for solving Multi Constrained Team Orienteering Problem for application in touristic trip planning / Sylejmani, K., Dorn, J., & Musliu, N. (2012). A Taboo Search approach for solving Multi Constrained Team Orienteering Problem for application in touristic trip planning. In 12th International Conference on HybridIntelligent Systems (pp. 300–305). IEEE Computer Society. http://hdl.handle.net/20.500.12708/54346
- Tourist trip planning: solo versus group traveling / Sylejmani, K., Dorn, J., & Musliu, N. (2012). Tourist trip planning: solo versus group traveling. In 30th Workshop of the UK Planning and Scheduling Special Interest Group. UK Planning and Scheduling Special Interest Group, Austria. SIGPLAN. http://hdl.handle.net/20.500.12708/54347
- Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming / Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2012). Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. In Y. Hamadi & M. Schoenauer (Eds.), Learning and Intelligent Optimization (pp. 130–144). Springer. https://doi.org/10.1007/978-3-642-34413-8_10
- A New Hyperheuristic Algorithm for Cross-Domain Search Problems / Lehrbaum, A., & Musliu, N. (2012). A New Hyperheuristic Algorithm for Cross-Domain Search Problems. In Y. Hamadi & M. Schoenauer (Eds.), Learning and Intelligent Optimization (pp. 437–442). Springer. https://doi.org/10.1007/978-3-642-34413-8_41
- An Effective Greedy Heuristic for the Social Golfer Problem / Triska, M., & Musliu, N. (2012). An Effective Greedy Heuristic for the Social Golfer Problem. Annals of Operations Research, 194(1), 413–425. https://doi.org/10.1007/s10479-011-0866-7
- An improved SAT formulation for the social golfer problem / Triska, M., & Musliu, N. (2012). An improved SAT formulation for the social golfer problem. Annals of Operations Research, 194(1), 427–438. https://doi.org/10.1007/s10479-010-0702-5
2011
- XHSTT: an XML archive for high school timetabling problems in different countries / Post, G., Kingston, J. H., Ahmadi, S., Daskalaki, S., Gogos, C., Kyngas, J., Nurmi, C., Musliu, N., Pillay, N., Santos, H., & Schaerf, A. (2011). XHSTT: an XML archive for high school timetabling problems in different countries. Annals of Operations Research, 218(1), 295–301. https://doi.org/10.1007/s10479-011-1012-2
- A New Tree-Decomposition Based Algorithm for Answer Set Programming / Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2011). A New Tree-Decomposition Based Algorithm for Answer Set Programming. In T. M. Khoshgoftaar & X. Zhu (Eds.), 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence. https://doi.org/10.1109/ictai.2011.154
- TEMPLE - A domain specific language for modeling and solving staff scheduling problems / Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2011). TEMPLE - A domain specific language for modeling and solving staff scheduling problems. In 2011 IEEE Symposium on Computational Intelligence in Scheduling (SCIS). Symposium on Computational Intelligence in Scheduling (SCIS), Paris, France, EU. https://doi.org/10.1109/scis.2011.5976550
- A Constraint Programming Application for Rotating Workforce Scheduling / Triska, M., & Musliu, N. (2011). A Constraint Programming Application for Rotating Workforce Scheduling. In Developing Concepts in Applied Intelligence (pp. 83–88). Studies in Computational Intelligence. https://doi.org/10.1007/978-3-642-21332-8_12
- Constructing Cyclic Staff Schedules by Iterated Local Search / Musliu, N. (2011). Constructing Cyclic Staff Schedules by Iterated Local Search. In Proceedings of the 9th Metaheuristic International Conference (MIC 2011) (pp. 655–657). http://hdl.handle.net/20.500.12708/53950
- Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming / Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2011). Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming (DBAI-TR-2011-73). http://hdl.handle.net/20.500.12708/37104
2010
- Scheduling content multicast trees with minimal repetitions / Bessler, S., Lang, L. F., & Musliu, N. (2010). Scheduling content multicast trees with minimal repetitions. In 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS). Networks 2010, Warsaw, Poland, EU. https://doi.org/10.1109/netwks.2010.5624910
- A hybrid LS-CP solver for the shifts and breaks design problem / Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2010). A hybrid LS-CP solver for the shifts and breaks design problem. In Proceedings of PATAT 2010 - The 8th International Conference on the Practice and Theory of Automated Timetabling (p. 3). http://hdl.handle.net/20.500.12708/53591
- A hybrid LS-CP solver for the shifts and breaks design problem / Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2010). A hybrid LS-CP solver for the shifts and breaks design problem. In Proceedings of 7th International Workshop on Hybrid Metaheuristics (pp. 46–61). Lecture Notes in Computer Sciences. http://hdl.handle.net/20.500.12708/53204
- A Break Scheduling System for Supervision Personnel Using AI techniques. / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2010). A Break Scheduling System for Supervision Personnel Using AI techniques. IEEE Intelligent Systems, 25(2), 60–73. http://hdl.handle.net/20.500.12708/165999
- An improved memetic algorithm for break scheduling / Widl, M., & Musliu, N. (2010). An improved memetic algorithm for break scheduling. In Proceddings of 7th International Workshop on Hybrid Metaheuristics (pp. 133–147). Lecture Notes in Computer Sciences. http://hdl.handle.net/20.500.12708/53207
- Ant Colony Optimization for Tree Decompositions / Hammerl, T., & Musliu, N. (2010). Ant Colony Optimization for Tree Decompositions. In Evolutionary Computation in Combinatorial Optimization, 10th European Conference, EvoCOP 2010, Proceedings (pp. 95–106). Lecture Notes in Computer Science, Springer. http://hdl.handle.net/20.500.12708/53205
2009
-
Testing while modelling staff scheduling problems
/
Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2009). Testing while modelling staff scheduling problems. In 23rd EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH, BOOK OF ABSTRACTS (p. 198). http://hdl.handle.net/20.500.12708/52811
Project: Softnet (2006–2011) -
Temple - a language for staff scheduling problems
/
Schafhauser, W., Beer, A., Gärtner, J., Musliu, N., & Slany, W. (2009). Temple - a language for staff scheduling problems. In 23rd EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH, BOOK OF ABSTRACTS (p. 198). http://hdl.handle.net/20.500.12708/52810
Project: Softnet (2006–2011) -
Local Search for Shift and Break Scheduling
/
Musliu, N., Beer, A., Gärtner, J., Schafhauser, W., & Slany, W. (2009). Local Search for Shift and Break Scheduling. In 23rd EUROPEAN CONFERENCE ON OPERATIONAL RESEARCH, BOOK OF ABSTRACTS (p. 102). http://hdl.handle.net/20.500.12708/52809
Project: Softnet (2006–2011) - TEMPLE - A Modeling Language for Resource Planning and Scheduling Problems / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2009). TEMPLE - A Modeling Language for Resource Planning and Scheduling Problems (DBAI-TR-2009-65). http://hdl.handle.net/20.500.12708/35721
-
A Memetic Algorithm for a Break Scheduling Problem
/
Musliu, N., Schafhauser, W., & Widl, M. (2009). A Memetic Algorithm for a Break Scheduling Problem. In Cd Mic 2009 (p. 10). http://hdl.handle.net/20.500.12708/52808
Project: Softnet (2006–2011)
2008
- Heuristic Methods for Hypertree Decomposition / Dermaku, A., Ganzow, T., Gottlob, G., McMahan, B. J., Musliu, N., & Samer, M. (2008). Heuristic Methods for Hypertree Decomposition. In MICAI 2008: Advances in Artificial Intelligence (pp. 1–11). Springer. https://doi.org/10.1007/978-3-540-88636-5_1
- An Iterative Heuristic Algorithm for Tree Decomposition / Musliu, N. (2008). An Iterative Heuristic Algorithm for Tree Decomposition. In C. Cotta & J. I. van Hemert (Eds.), Recent Advances in Evolutionary Computation for Combinatorial Optimization. Studies in Computational Intelligence, Volume 153/2008 (pp. 133–150). Springer. http://hdl.handle.net/20.500.12708/26169
- Scheduling Breaks in Shift Plans for Call Centers / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2008). Scheduling Breaks in Shift Plans for Call Centers. In Proceedings of PATAT 2008 - The 7th International Conference on the Practice and Theory of Automated Timetabling (p. 17). http://hdl.handle.net/20.500.12708/52274
- An Iterated Local Search Algorithm for a Real-Life Break Scheduling Problem / Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2008). An Iterated Local Search Algorithm for a Real-Life Break Scheduling Problem. Matheuristics2008 - Second International Workshop on Model Based Metaheuristics, Bertinoro, Italien, EU. http://hdl.handle.net/20.500.12708/84743
- Solving the Social Golfer Problem with a GRASP / Triska, M., & Musliu, N. (2008). Solving the Social Golfer Problem with a GRASP. In In Proceedings of PATAT 2008 - The 7th International Conference on the Practice and Theory of Automated Timetabling (p. 12). http://hdl.handle.net/20.500.12708/52343
- An Improved SAT Formulation for the Social Golfer Problem / Triska, M., & Musliu, N. (2008). An Improved SAT Formulation for the Social Golfer Problem. In Proceedings of PATAT 2008 - The 7th International Conference on the Practice and Theory of Automated Timetabling (p. 13). http://hdl.handle.net/20.500.12708/52280
2007
- The Minimum Shift Design Problem / Di Gaspero, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., & Slany, W. (2007). The Minimum Shift Design Problem. Annals of Operations Research, 155(1), 79–105. http://hdl.handle.net/20.500.12708/169640
-
Tabu Search for Generalized Hypertree Decompositions
/
Musliu, N. (2007). Tabu Search for Generalized Hypertree Decompositions. In MIC 2007: The Seventh Metaheuristics International Conference (p. 3). http://hdl.handle.net/20.500.12708/51823
Project: Hypertree (2004–2006) -
Genetic algorithms for generalized hypertree decompositions
/
Musliu, N., & Schafhauser, W. (2007). Genetic algorithms for generalized hypertree decompositions. European Journal of Industrial Engineering, 1(3), 317–340. http://hdl.handle.net/20.500.12708/169638
Project: Hypertree (2004–2006) -
Iterated Local Search for Cyclic Staff Scheduling
/
Musliu, N. (2007). Iterated Local Search for Cyclic Staff Scheduling. In EURO XXII: 22nd European Conference on Operational Research (Book of Abstracts) (p. 143). http://hdl.handle.net/20.500.12708/51824
Project: Softnet (2006–2011) -
Generation of Tree Decompositions by Iterated Local Search
/
Musliu, N. (2007). Generation of Tree Decompositions by Iterated Local Search. In Proceedings of the Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation, EvoCOP 2007, LNCS, Volume 4446 (pp. 130–141). http://hdl.handle.net/20.500.12708/51799
Project: Hypertree (2004–2006)
2006
- Heuristic Methods for Automatic Rotating Workforce Scheduling / Musliu, N. (2006). Heuristic Methods for Automatic Rotating Workforce Scheduling. International Journal of Computational Intelligence Research, 2(4), 309–326. http://hdl.handle.net/20.500.12708/173438
-
An Iterative Heuristic Algorithm for Tree Decompositions
/
Musliu, N. (2006). An Iterative Heuristic Algorithm for Tree Decompositions. In EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics (pp. 1–5). http://hdl.handle.net/20.500.12708/51669
Project: Hypertree (2004–2006) -
Local Search Algorithm for Unicost Set Covering Problem
/
Musliu, N. (2006). Local Search Algorithm for Unicost Set Covering Problem. In M. Ali & R. Dapoigny (Eds.), Advances in Applied Artificial Intelligence (pp. 302–311). Springer. http://hdl.handle.net/20.500.12708/51362
Project: Hypertree (2004–2006)
2005
- Theory and Practice of the Minimum Shift Design Problem / Di Gaspero, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., & Slany, W. (2005). Theory and Practice of the Minimum Shift Design Problem. In In Metaheuristics: Progress as Real Problem Solvers, Ibaraki, Toshihide; Nonobe, Koji; Yagiura, Mutsunori (Eds.) (pp. 159–180). Springer. http://hdl.handle.net/20.500.12708/25353
- Combination of Local Search Strategies for Rotating Workforce Scheduling Problem / Musliu, N. (2005). Combination of Local Search Strategies for Rotating Workforce Scheduling Problem. In IJCAI-05 Proceedings (pp. 1529–1530). Professional Book Center. http://hdl.handle.net/20.500.12708/51045
- Min Conflicts Based Heuristics for Rotating Workforce Scheduling Problem / Musliu, N. (2005). Min Conflicts Based Heuristics for Rotating Workforce Scheduling Problem. In Proceedings of the 6th Metaheuristics International Conference (p. 6). http://hdl.handle.net/20.500.12708/51027
-
Hypertree Decompositions: Structure, Algorithms, and Applications
/
Gottlob, G., Grohe, M., Musliu, N., Samer, M., & Scarcello, F. (2005). Hypertree Decompositions: Structure, Algorithms, and Applications. In D. Kratsch (Ed.), Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (pp. 1–15). Springer-Verlag Berlin Heidelberg. http://hdl.handle.net/20.500.12708/51014
Project: Hypertree (2004–2006)
2004
- A Heuristic Based System for Generation of Shifts with Breaks / Gärtner, J., Musliu, N., & Slany, W. (2004). A Heuristic Based System for Generation of Shifts with Breaks. In Proceedings of the Twenty-fourth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (pp. 95–106). Springer. http://hdl.handle.net/20.500.12708/50981
2001
- Intelligent search methods for workforce scheduling : new ideas and practical applications / Musliu, N. (2001). Intelligent search methods for workforce scheduling : new ideas and practical applications [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/179297
Supervisions
2024
-
Exact Methods for the Time Frame Rostering Problem : In the Context of Tram Driver Rostering
/
Frühwirth, L. (2024). Exact Methods for the Time Frame Rostering Problem : In the Context of Tram Driver Rostering [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.118882
Download: PDF (682 KB) -
A general approach to preselect useful interviews in online surveys
/
Czapka, P. (2024). A general approach to preselect useful interviews in online surveys [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.121362
Download: PDF (2.23 MB) -
Optimizing constraint programming for real world scheduling of test Laboratories
/
Danzinger, P. (2024). Optimizing constraint programming for real world scheduling of test Laboratories [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.110696
Download: PDF (788 KB) -
Detecting depression and anxiety on social media using selective masking
/
Mullatahiri, P. (2024). Detecting depression and anxiety on social media using selective masking [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.107269
Download: PDF (1.96 MB)
2023
-
Adaptive large neighbourhood search for double-round-Robin sports tournament problem
/
Krystallidis, A. (2023). Adaptive large neighbourhood search for double-round-Robin sports tournament problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.108681
Download: PDF (774 KB) -
A metaheuristic approach to crowdsourced package delivery
/
Longo, G. L. (2023). A metaheuristic approach to crowdsourced package delivery [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.101084
Download: PDF (897 KB) -
Using machine learning to predict Photovoltaic energy production
/
Steinbrecher, M. (2023). Using machine learning to predict Photovoltaic energy production [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.110584
Download: PDF (2.37 MB) -
A quadratic unconstrained binary optimization approach for qubit mapping
/
Prielinger, L. (2023). A quadratic unconstrained binary optimization approach for qubit mapping [Diploma Thesis, Technische Universität Wien; Delft University of Technology]. reposiTUm. https://doi.org/10.34726/hss.2023.111181
Download: PDF (2.06 MB) -
Predicting taxi times, runway assignment, and deicing usage at Vienna airport
/
Scheicher, A. (2023). Predicting taxi times, runway assignment, and deicing usage at Vienna airport [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.106061
Download: PDF (2.46 MB) -
Solving the production leveling problem with memetic algorithms
/
Malik, P. (2023). Solving the production leveling problem with memetic algorithms [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.110761
Download: PDF (1.77 MB)
2022
-
Automated solution methods for complex real-life personnel scheduling problems
/
Kletzander, L. (2022). Automated solution methods for complex real-life personnel scheduling problems [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.108382
Download: PDF (2.79 MB) -
Automated project scheduling in real-world test laboratories
/
Mischek, F. (2022). Automated project scheduling in real-world test laboratories [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.107689
Download: PDF (1.87 MB) -
Solving multi-mode resource-constrained multi-project scheduling problems by hybrid algorithms
/
Ahmeti, A. (2022). Solving multi-mode resource-constrained multi-project scheduling problems by hybrid algorithms [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.103426
Download: PDF (1.98 MB) -
Improving learned decision trees with domain ontologies
/
Llugiqi, M. (2022). Improving learned decision trees with domain ontologies [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99442
Download: PDF (1.79 MB) -
Large-scale multi-agent meeting scheduling using an altruistic matching heuristic
/
Wiedemair, F. (2022). Large-scale multi-agent meeting scheduling using an altruistic matching heuristic [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.80202
Download: PDF (1.3 MB)
2021
-
Automated scheduling for automotive supplier paint shops and teeth manufacturing
/
Winter, F. (2021). Automated scheduling for automotive supplier paint shops and teeth manufacturing [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.100623
Download: PDF (1.7 MB) -
Algorithm selection using machine learning for sudoku puzzles
/
Kumar, R. (2021). Algorithm selection using machine learning for sudoku puzzles [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.95821
Download: PDF (1.12 MB) -
Applying machine learning for processing time prediction for inbound shipments
/
Eichhorner, F. (2021). Applying machine learning for processing time prediction for inbound shipments [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.84964
Download: PDF (1.52 MB) -
Representation learning for variable-sized multiple sequence alignments
/
Drucks, T. (2021). Representation learning for variable-sized multiple sequence alignments [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.88083
Download: PDF (24.3 MB) -
Automated machine learning using metaheuristic algorithms
/
Rexha, G. (2021). Automated machine learning using metaheuristic algorithms [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.86803
Download: PDF (1.16 MB)
2020
-
Investigating constraint programming and hybrid answer-set solving for industrial test laboratory scheduling
/
Geibinger, T. (2020). Investigating constraint programming and hybrid answer-set solving for industrial test laboratory scheduling [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.73541
Download: PDF (654 KB) -
Solving the paintshop scheduling problem with memetic algorithms
/
Weintritt, W. (2020). Solving the paintshop scheduling problem with memetic algorithms [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.80201
Download: PDF (1.24 MB) -
Instance space analysis for the job shop scheduling problem
/
Strassl, S. (2020). Instance space analysis for the job shop scheduling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.80620
Download: PDF (11 MB)
2019
-
Exact and metaheuristic approaches for the production leveling problem
/
Vass, J. (2019). Exact and metaheuristic approaches for the production leveling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.70283
Download: PDF (1.5 MB) -
Application of machine learning in production scheduling
/
Faustmann, G. (2019). Application of machine learning in production scheduling [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.68471
Download: PDF (1.1 MB) -
Exact and heuristic approaches for unrelated parallel machine scheduling
/
Moser, M. (2019). Exact and heuristic approaches for unrelated parallel machine scheduling [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.69323
Download: PDF (1.52 MB)
2018
-
Algorithm selection and performance prediction for the examination timetabling problem
/
Zhukova, O. (2018). Algorithm selection and performance prediction for the examination timetabling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.39302
Download: PDF (6.31 MB) -
A Heuristic solver framework for the general employee scheduling problem
/
Kletzander, L. (2018). A Heuristic solver framework for the general employee scheduling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.51761
Download: PDF (888 KB)
2017
-
SAT-Based approaches for the general high school timetabling problem
/
Demirović, E. (2017). SAT-Based approaches for the general high school timetabling problem [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.43762
Download: PDF (939 KB) -
Algorithm selection and runtime prediction for the two dimensional bin packing problem : analysis and characterization of instances
/
Ivanschitz, B.-P. (2017). Algorithm selection and runtime prediction for the two dimensional bin packing problem : analysis and characterization of instances [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.38324
Download: PDF (2.08 MB) -
A graphical environment for creating constraint programming models
/
Blöschl, M. (2017). A graphical environment for creating constraint programming models [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.48160
Download: PDF (923 KB) -
A comparison of machine learning techniques on the medical data sets
/
Karami, O. (2017). A comparison of machine learning techniques on the medical data sets [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.41665
Download: PDF (8.57 MB) -
Tailored tree decompositions for efficient problem solving
/
Abseher, M. (2017). Tailored tree decompositions for efficient problem solving [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.25691
Download: PDF (1.29 MB)
2016
-
MaxSAT modeling and metaheuristic methods for the employee scheduling problem
/
Winter, F. (2016). MaxSAT modeling and metaheuristic methods for the employee scheduling problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.36862
Download: PDF (812 KB) -
Exact and heuristic approaches for a multi-stage nurse rostering problem
/
Mischek, F. (2016). Exact and heuristic approaches for a multi-stage nurse rostering problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.36864
Download: PDF (803 KB) -
Large neighborhood search for break scheduling
/
Züger, M.-E. (2016). Large neighborhood search for break scheduling [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.35600
Download: PDF (782 KB)
2015
-
Exact methods for shift design and break scheduling
/
Kocabas, D. (2015). Exact methods for shift design and break scheduling [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.28460
Download: PDF (640 KB)
2014
-
Memetic algorithms for tree decomposition
/
Bader, K. (2014). Memetic algorithms for tree decomposition [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.23717
Download: PDF (1.88 MB)
2013
-
Solving shift design problems with answer set programming
/
Abseher, M. (2013). Solving shift design problems with answer set programming [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-51534
Download: PDF (571 KB) -
Correctness considerations in CLP(FD) systems
/
Triska, M. (2013). Correctness considerations in CLP(FD) systems [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.23573
Download: PDF (794 KB)
2012
-
Algorithm selection for the graph coloring problem
/
Schwengerer, M. (2012). Algorithm selection for the graph coloring problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-60964
Download: PDF (2.79 MB) - Iterated local search for the traveling tournament problem / Kim, B. M. (2012). Iterated local search for the traveling tournament problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160575
2011
- A new hyperheuristic algorithm for cross-domain search problems / Lehrbaum, A. (2011). A new hyperheuristic algorithm for cross-domain search problems [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160481
- An efficient algorithm for phylogeny reconstruction by maximum likelihood / Nguyen, L.-T. (2011). An efficient algorithm for phylogeny reconstruction by maximum likelihood [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160135
2010
-
TEMPLE - a domain specific language for modeling and solving real-life staff scheduling problems
/
Schafhauser, W. (2010). TEMPLE - a domain specific language for modeling and solving real-life staff scheduling problems [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-38928
Download: PDF (2.89 MB) - Memetic algorithms for break scheduling / Widl, M. (2010). Memetic algorithms for break scheduling [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/159803
2009
- Ant colony optimization for tree and hypertree decompositions / Hammerl, T. (2009). Ant colony optimization for tree and hypertree decompositions [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185662
2008
-
Data mining on empty result queries
/
Lee, M. S. (2008). Data mining on empty result queries [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-28140
Download: PDF (1.32 MB) -
Generic programming for graph problems using tree decompositions
/
Paisios, E. (2008). Generic programming for graph problems using tree decompositions [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-26415
Download: PDF (722 KB) -
Hypertree decompositions for optimal winner determination in combinatorial auctions
/
Lebedeva, E. (2008). Hypertree decompositions for optimal winner determination in combinatorial auctions [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-28719
Download: PDF (778 KB) - Solution methods for the social golfer problem / Triska, M. (2008). Solution methods for the social golfer problem [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186405
2006
-
New heuristic methods for tree decompositions and generalized hypertree decompositions
/
Schafhauser, W. (2006). New heuristic methods for tree decompositions and generalized hypertree decompositions [Master Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-96365
Download: PDF (770 KB) - Generalized hypertree decomposition based on hypergraph partitioning / Dermaku, A. (2006). Generalized hypertree decomposition based on hypergraph partitioning [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181386
- A new Tabu Search framework and it's application / Mörz, M. (2006). A new Tabu Search framework and it’s application [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/178619
Awards
-
Best Industry and Applications Track Paper Award
2022 / ICAPS 2022 / Singapore / Website -
Best Practices in Education Award
2019 / Informatics Europe / Switzerland / Website -
Distinguished student (Student i dalluar) award from the University of Prishtina, Kosova.
1995 / University of Prishitna / Kosovo
And more…
Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.
Until then, please visit Nysret Musliu’s research profile in TISS .