Journal papers

[1]
Alex Bonutti, Sara Ceschia, Fabio De Cesco, Nysret Musliu, and Andrea Schaerf. Modeling and solving a real-life multi-skill shift design problem. Annals of Operations Research, 252(2):365--382, 2017. [ bib | DOI ]
[2]
Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf, and Tommaso Urli. Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Computers & Operations Research, 65:83--92, 2016. [ bib | DOI | .pdf ]
[3]
Gerhard Post, Luca Di Gaspero, Jeffrey H. Kingston, Barry McCollum, and Andrea Schaerf. The third international timetabling competition. Annals of Operations Research, 239(1):69--75, 2016. [ bib | DOI | http ]
[4]
Sara Ceschia and Andrea Schaerf. Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. Journal of Scheduling, 19(4):377--389, 2016. [ bib | DOI | .pdf ]
[5]
Michele Battistutta, Andrea Schaerf, and Tommaso Urli. Feature-based tuning of single-stage simulated annealing for examination timetabling. Annals of Operations Research, pages 1--16, 2015. Online first. [ bib | DOI ]
[6]
Andrea Schaerf. Comments on: An overview of curriculum-based course timetabling. TOP, 23(2):362--365, 2015. [ bib | DOI | .pdf ]
[7]
Gerhard Post, Jeffrey Kingston, Samad Ahmadi, Sophia Daskalaki, Christos Gogos, Jari Kyngas, Cimmo Nurmi, Nysret Musliu, Nelishia Pillay, Haroldo Santos, and Andrea Schaerf. XHSTT: an XML archive for high school timetabling problems in different countries. Annals of Operations Research, 218(1):295--301, 2014. [ bib | DOI ]
[8]
Stefaan Haspeslagh, Patrick De Causmaecker, Martin Stølevik, and Andrea Schaerf. The first international nurse rostering competition 2010. Annals of Operations Research, 218(1):221--236, 2014. [ bib | DOI ]
[9]
Sara Ceschia, Luca Di Gaspero, and Andrea Schaerf. The generalized balanced academic curriculum problem with heterogeneous classes. Annals of Operations Research, 218(1):147--163, 2014. [ bib | DOI | .pdf ]
[10]
Sara Ceschia and Andrea Schaerf. Local search for a multi-drop multi-container loading problem. Journal of Heuristics, 19(2):275--294, 2013. [ bib | .pdf ]
[11]
Sara Ceschia, Andrea Schaerf, and Thomas Stützle. Local search techniques for a routing-packing problem. Computers & Industrial Engineering, 66(4):1138--1149, 2013. [ bib | DOI | .pdf ]
[12]
Ruggero Bellio, Luca Di Gaspero, and Andrea Schaerf. Design and statistical analysis of a hybrid local search algorithm for course timetabling. Journal of Scheduling, 15(1):49--61, 2012. [ bib | DOI ]
[13]
Marco Chiarandini, Luca Di Gaspero, Stefano Gualandi, and Andrea Schaerf. The balanced academic curriculum problem revisited. Journal of Heuristics, 18(1):119--148, 2012. [ bib | DOI ]
[14]
Alex Bonutti, Fabio De Cesco, Luca Di Gaspero, and Andrea Schaerf. Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results. Annals of Operations Research, 194(1):59--70, 2012. [ bib | DOI ]
[15]
Sara Ceschia and Andrea Schaerf. Modeling and solving the dynamic patient admission scheduling problem under uncertainty. Artificial Intelligence in Medicine, 56(3):199--205, 2012. [ bib | DOI | .pdf ]
[16]
Sara Ceschia, Luca Di Gaspero, and Andrea Schaerf. Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Computers & Operations Research, 39(7):1615--1624, 2011. [ bib | DOI | .pdf ]
[17]
Sara Ceschia and Andrea Schaerf. Local search and lower bounds for the patient admission scheduling problem. Computers & Operations Research, 38(10):1452--1463, 2011. [ bib | DOI | .pdf ]
[18]
Sara Ceschia, Luca Di Gaspero, and Andrea Schaerf. Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. Journal of Scheduling, 14(6):601--615, 2011. [ bib | DOI | .pdf ]
[19]
Luca Di Gaspero, Giacomo Di Tollo, Andrea Roli, and Andrea Schaerf. Hybrid metaheuristics for constrained portfolio selection problem. Quantitative Finance, 11(10):1473--1488, 2011. [ bib | DOI ]
[20]
Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhyd Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, and Edmund K. Burke. Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing, 22(1):120--130, 2010. [ bib | DOI ]
[21]
Luca Di Gaspero and Andrea Schaerf. A composite-neighborhood tabu search approach to the traveling tournament problem. Journal of Heuristics, 13(2):189--207, April 2007. [ bib | DOI | .pdf ]
[22]
Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. The minimum shift design problem. Annals of Operations Research, 155:79--105, 2007. [ bib | DOI ]
[23]
Luca Di Gaspero and Andrea Schaerf. Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms, 5(1):65--89, 2006. [ bib | DOI | .pdf ]
[24]
Marco Cadoli and Andrea Schaerf. Compiling problem specifications into SAT. Artificial Intelligence, 162:89--120, 2005. [ bib | DOI | .pdf ]
[25]
Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. Local search for shift design. European Journal of Operational Research, 153:51--64, 2004. [ bib | .pdf ]
[26]
Luca Di Gaspero and Andrea Schaerf. Il problema della generazione automatica dell'orario delle lezioni: teoria e pratica. Intelligenza Artificiale, 1(3):47--54, 2004. In Italian. [ bib | .pdf ]
[27]
Luca Di Gaspero and Andrea Schaerf. EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software --- Practice & Experience, 33(8):733--765, July 2003. [ bib | .pdf ]
[28]
Amnon Meisels and Andrea Schaerf. Modelling and solving employee timetabling problems. Annals of Mathematics and Artificial Intelligence, 39(1-2):41--59, 2003. [ bib | .pdf ]
[29]
Andrea Schaerf. Local search techniques for constrained portfolio selection problems. Computational Economics, 20(3):177--190, 2002. [ bib | .pdf ]
[30]
Andrea Schaerf, Marco Cadoli, and Maurizio Lenzerini. Local++: A C++ framework for local search algorithms. Software -- Practice & Experience, 30(3):233--257, 2000. [ bib | .pdf ]
[31]
Marco Cadoli, Giovambattista Ianni, Luigi Palopoli, Andrea Schaerf, and Domenico Vasile. NP-Spec: An executable specification language for solving all problems in np. Computer Languages, 26:165--195, 2000. [ bib | .pdf ]
[32]
Andrea Schaerf. Scheduling sport tournaments using constraint logic programming. CONSTRAINTS, 4(1):43--65, 1999. [ bib | .pdf ]
[33]
Andrea Schaerf. Local search techniques for large high-school timetabling problems. IEEE Transactions on Systems, Man, and Cybernetics--- Part A: Systems and Humans, 29(4):368--377, 1999. [ bib | .pdf ]
[34]
Andrea Schaerf. A survey of automated timetabling. Artificial Intelligence Review, 13(2):87--127, 1999. [ bib | .pdf ]
[35]
Martin Buchheit, Francesco M. Donini, Werner Nutt, and Andrea Schaerf. A refined architecture for terminological systems: Terminology = schema + views. Artificial Intelligence, 99(2):209--260, 1998. [ bib | .pdf ]
[36]
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt, and Andrea Schaerf. Adding epistemic operators to description logics. Artificial Intelligence, 100(1-2):225--274, 1998. [ bib | .pdf ]
[37]
Krzysztof R. Apt, Jacob Brunekreef, Vincent Partington, and Andrea Schaerf. Alma-0: An imperative language that supports declarative programming. ACM Transactions on Programming Languages and Systems, 20(5):1014--1066, 1998. [ bib | .pdf ]
[38]
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, and Andrea Schaerf. al-log: integrating datalog and description logics. Journal of Intelligent Information Systems, 10(227--252), 1998. [ bib | .pdf ]
[39]
Andrea Schaerf, Yoav Shoham, and Moshe Tennenholtz. Adaptive load balancing: a study in multi-agent learning. Journal of Artificial Intelligence Research, 2:475--500, 1995. [ bib | .pdf ]
[40]
Andrea Schaerf. Reasoning with individuals in concept languages. Data Knowledge Engineering, 13(2):141--176, 1994. [ bib | .pdf ]
[41]
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, and Andrea Schaerf. Deduction in concept languages: From subsumption to instance checking. Journal of Logic and Computation, 4(4):423--452, 1994. [ bib | .pdf ]
[42]
Martin Buchheit, Francesco M. Donini, and Andrea Schaerf. Decidable reasoning in terminological knowledge representation systems. Journal of Artificial Intelligence Research, 1:109--138, 1993. [ bib | .pdf ]
[43]
Andrea Schaerf. On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems, 2:265--278, 1993. [ bib ]

Books

[1]
Marco Cadoli, Maurizio Lenzerini, Emanuele Panizzi, and Andrea Schaerf. Esercizi di progettazione di programmi in C++. CittàStudiEdizioni di UTET Libreria, Milano, Italy, 1998. In Italian. [ bib ]
[2]
Marco Cadoli, Maurizio Lenzerini, Paolo Naggar, and Andrea Schaerf. Fondamenti della progettazione dei programmi. Princìpi, tecniche e loro applicazioni in C++. CittàStudiEdizioni di UTET Libreria, Milano, Italy, 1997. In Italian. [ bib ]

Edited books or collections

[1]
Luca Di Gaspero, Andrea Schaerf, and Thomas Stützle, editors. Advances in Metaheuristics. OR/CS. Springer Science+Business Media, New York, USA, 2013. [ bib ]
[2]
Luca Di Gaspero, Andrea Schaerf, and Thomas Stützle, editors. Proceedings of the 9th Metaheuristics International Conference (MIC 2011). Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica - Università degli Studi di Udine, Udine, Italy, July 25--28 2011. Electronic proceedings. [ bib ]
[3]
Maria J. Blesa Aguilera, Christian Blum, Luca Di Gaspero, Andrea Roli, Michael Sampels, and Andrea Schaerf, editors. Hybrid Metaheuristics 6th International Workshop, HM 2009 Udine, Italy, October 16-17, 2009 Proceedings, volume 5818 of Lecture Notes in Computer Science. Springer-Verlag, Berlin-Heidelberg, Germany, 2009. [ bib ]

Chapters of edited books

[1]
Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, and Wolfgang Slany. Automated shift design and break scheduling. In A. Sima Etaner-Uyar, Ender Özcan, and Neil Urquhart, editors, Automated Scheduling and Planning - From Theory to Practice, volume 505 of Studies in Computational Intelligence, pages 109--127. Springer-Verlag, 2013. [ bib | DOI ]
[2]
Luca Di Gaspero and Andrea Schaerf. EasySyn++: A tool for automatic synthesis of stochastic local search algorithms. In Thomas Stützle, Mauro Birattari, and Holger H. Hoos, editors, Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings, number 4683, pages 177--181. Springer Verlag, Berlin-Heidelberg, Germany, 2007. [ bib | .pdf ]
[3]
Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. Theory and practice of the minimum shift design problem. In Toshihide Ibaraki, Koji Nonobe, and Mutsunori Yagiura, editors, Metaheuristics: Progress as Real Problem Solvers, chapter 7, pages 159--180. Kluwer Academic Publishers, Boston (MA), USA, 2005. [ bib | .pdf ]
[4]
Luca Di Gaspero and Andrea Schaerf. Writing local search algorithms using EasyLocal++. In Stefan Voß and David L. Woodruff, editors, Optimization Software Class Libraries, OR/CS. Kluwer Academic Publisher, Boston (MA), USA, 2002. [ bib | .pdf ]
[5]
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, and Andrea Schaerf. Reasoning in description logics. In Gerhard Brewka, editor, Foundation of Knowledge Representation, pages 191--236. CSLI-Publications, 1996. [ bib | .pdf ]

Papers in collections

[1]
Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, and Wolfgang Slany. A hybrid LS-CP solver for the shifts and breaks design problem. In Maria J. Blesa Aguilera, Christian Blum, Günther Raidl, Andrea Roli, and Michael Sampels, editors, Hybrid Metaheuristics 7th International Workshop, HM 2010 Vienna, Austria, October 1-2, 2010 Proceedings, volume 6373 of Lecture Notes in Computer Science, pages 46--61. Springer-Verlag, 2010. [ bib ]
[2]
Luca Di Gaspero and Andrea Schaerf. Hybrid local search techniques for the generalized balanced academic curriculum problem. In Maria J. Blesa Aguilera, Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo, Andrea Roli, and Michael Sampels, editors, Hybrid Metaheuristics 5th International Workshop, HM 2008, Málaga, Spain, October 8-9, 2008. Proceedings, volume 5296 of Lecture Notes in Computer Science, pages 146--157. Springer Verlag, Berlin-Heidelberg, Germany, 2008. [ bib | .pdf ]
[3]
Andrea Schaerf and Luca Di Gaspero. Measurability and reproducibility in timetabling research: Discussion and proposals. In Edmund K. Burke and Hana Rudova, editors, ractice and Theory of Automated Timetabling VI, 6th International Conference, PATAT 2006, Brno, Czech Republic, August 30 - September 1, 2006, Revised Selected Papers., volume 3867 of Lecture Notes in Computer Science, pages 40--49. Springer Verlag, 2007. Extended and revised version of [?]. [ bib | .pdf ]
[4]
Luca Di Gaspero, Andrea Roli, and Andrea Schaerf. EasyAnalyzer: an object-oriented framework for the analysis of stochastic local search algorithms. In Thomas Stützle, Mauro Birattari, and Holger H. Hoos, editors, Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings, volume 4683 of Lecture Notes in Computer Science, pages 76--90. Springer Verlag, Berlin-Heidelberg, Germany, 2007. [ bib | .pdf ]
[5]
Luca Di Gaspero, Giacomo Di Tollo, Andrea Roli, and Andrea Schaerf. Hybrid local search for constrained financial portfolio selection problems. In Pascal Van Hentenryck and Laurence Wolsey, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings, volume 4510 of Lecture Notes in Computer Science, pages 44--58. Springer Verlag, 2007. [ bib | .pdf ]
[6]
Luca Di Gaspero and Andrea Schaerf. Multi-neighbourhood local search with application to course timetabling. In Edmund K. Burke and Patrick De Causmaecker, editors, Practice and Theory of Automated Timetabling IV, volume 2740 of Lecture Notes in Computer Science, pages 262--275. Springer Verlag, Berlin-Heidelberg, Germany, 2003. [ bib ]
[7]
Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. The minimum shift design problem: theory and practice. In Giuseppe Di Battista and Uri Zwick, editors, Algorithms - ESA 2003, Proceedings of the 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, volume 2832 of Lecture Notes in Computer Science, pages 580--592. Springer Verlag, Berlin-Heidelberg, Germany, 2003. [ bib ]
[8]
Luca Di Gaspero and Andrea Schaerf. Tabu search techniques for examination timetabling. In E. Burke and W. Erben, editors, Practice and Theory of Automated Timetabling III, volume 2079 of Lecture Notes in Computer Science, pages 104--117. Springer Verlag, Berlin-Heidelberg, Germany, 2001. [ bib | .pdf ]
[9]
Krzysztof R. Apt and Andrea Schaerf. The Alma project, or how first-order logic can help us in imperative programming. In E.-R. Olderog and R. Steffen, editors, Correct System Design, Lecture Notes in Computer Science. Springer Verlag, 1999. [ bib | .pdf ]

Conference papers

[1]
Davide Armellini, Paolo Borzone, Sara Ceschia, Luca Di Gaspero, and Andrea Schaerf. A metaheuristic approach for scheduling steelmaking and casting plants. In Proceedings of the 12th Metaheuristics International Conference (MIC-2017), pages 462--464, Barcelona, Spain, 2017. [ bib | .pdf ]
[2]
Michele Battistutta, Michael Bisson, Fabio De Cesco, and Andrea Schaerf. Referee assignment for a basketball league with multiple divisions using local search. In Proceedings of the 12th Metaheuristics International Conference (MIC-2017), pages 339--341, Barcelona, Spain, 2017. [ bib | .pdf ]
[3]
Sara Ceschia, Luca Di Gaspero, Andrea Schaerf, and Tommaso Urli. A general local search solver for flatzinc. In Proceedings of the 11th Metaheuristics International Conference (MIC 2015), pages 1--3, Agadir, Morocco, June 7-10 2015. [ bib ]
[4]
Michele Battistutta, Sara Ceschia, Fabio De Cesco, and Andrea Schaerf. Thesis defense timetabling. In 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), pages 507--514, 2015. ISSN: 2305-249X. [ bib | .pdf ]
[5]
Michele Battistutta, Andrea Schaerf, and Tommaso Urli. Feature-based tuning of single-stage simulated annealing for examination timetabling. In Proceedings of the 10th International Conference on Practice and Theory of Automated Timetabling (PATAT 2014), pages 53--61, August 26-29, 2014. [ bib ]
[6]
Alex Bonutti, Fabio De Cesco, Nysret Musliu, and Andrea Schaerf. Modeling and solving a real-life multi-skill shift design problem. In Proceedings of the 10th International Conference on Practice and Theory of Automated Timetabling (PATAT 2014), pages 459--461, August 26-29, 2014. [ bib ]
[7]
Sara Ceschia, Nguyen Thi Thanh Dang, Patrick De Causmaecker, Stefaan Haspeslagh, and Andrea Schaerf. The second international nurse rostering competition. In Proceedings of the 10th International Conference on Practice and Theory of Automated Timetabling (PATAT 2014), pages 554--556, August 26-29, 2014. [ bib ]
[8]
Sara Ceschia and Andrea Schaerf. The dynamic patient admission scheduling with operating room constraints, flexible horizon, and patient delays,. In 6th Multidisciplinary International Conference on Scheduling: Theory and Applications, pages 646--648, Ghent, Belgium, 27--29 August 2013. [ bib ]
[9]
Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf, and Tommaso Urli. A simulated annealing approach to the curriculum-based course timetabling problem. In 6th Multidisciplinary International Conference on Scheduling: Theory and Applications, pages 314--317, Ghent, Belgium, 27--29 August 2013. [ bib ]
[10]
Sara Ceschia and Andrea Schaerf. Patient admission scheduling with operating room constraints. In Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2012), Son, Norway, 28--31 August 2012. [ bib | .pdf ]
[11]
Sara Ceschia, Andrea Schaerf, and Thomas Stützle. Local search for a routing-packing problem. In Proceedings of the 9th Metaheuristics International Conference (MIC 2011), Udine, Italy, July 25--28 2011. [ bib ]
[12]
Sara Ceschia and Andrea Schaerf. Local search for the patient admission scheduling problem under uncertainty. In Proceedings of the 9th Metaheuristics International Conference (MIC 2011), Udine, Italy, July 25--28 2011. [ bib ]
[13]
G. Post, J. H. Kingston, S. Ahmadi, S. Daskalaki, C. Gogos, J. Kyngas, C. Nurmi, H. Santos, B. Roije, and A. Schaerf. An xml format for benchmarks in high school. In E. Burke and B. McCollum, editors, Proceedings of the 8th International Conference on Practice and Theory of Automated Timetabling (PATAT 2010), August 10-13, 2010. [ bib ]
[14]
Stefaan Haspeslagh, Patrick De Causmaecker, Martin Stølevik, and Andrea Schaerf. First international nurse rostering competition 2010. In E. Burke and B. McCollum, editors, Proceedings of the 8th International Conference on Practice and Theory of Automated Timetabling (PATAT 2010), August 10-13, 2010. [ bib ]
[15]
Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, and Wolfgang Slany. A hybrid ls-cp solver for the shifts and breaks design problem. In Barry McCollum, editor, Proceedings of the 8th International Conference on Practice and Theory of Automated Timetabling (PATAT 2010), August 10-13, 2010. [ bib ]
[16]
Sara Ceschia and Andrea Schaerf. Local search techniques for 3-dimensional packing. In 5th Metaheuristic International Conference, Hamburg, Germany, 13--16 July 2009. [ bib ]
[17]
Sara Ceschia and Andrea Schaerf. Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. In 4th Multidisciplinary International Conference on Scheduling: Theory and Applications, Dublin, Ireland, 10--12 August 2009. [ bib ]
[18]
Fabio De Cesco, Luca Di Gaspero, and Andrea Schaerf. Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results. In Michel Gendreau and Edmund K. Burke, editors, Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2008), pages 1--11, 2008. Available as electronic proceedings. [ bib ]
[19]
Ruggero Bellio, Luca Di Gaspero, and Andrea Schaerf. A statistical analysis of the features of a dynamic tabu search algorithm for course timetabling problems. In Michel Gendreau and Edmund K. Burke, editors, Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2008), pages 1--3, 2008. Available as electronic proceedings. [ bib ]
[20]
Luca Di Gaspero, Giacomo Di Tollo, Andrea Roli, and Andrea Schaerf. Hybrid metaheuristics for portfolio selection problems. In Proceedings of the 7th Metaheuristics International Conference (MIC 2007), Montreal, Canada, June 25--29 2007. [ bib ]
[21]
Giacomo Di Tollo, Luca Di Gaspero, Andrea Roli, and Andrea Schaerf. Solving portfolio selection problems through hybrid techniques. In Manfred Gilli, Ilir Roko, and Hilda Hysi, editors, Abstracts of the 4th International Conference on Computational Management Science (CMS 2007), pages 2--3, April 20--22 2007. Extended abstract of the talk. [ bib ]
[22]
Andrea Zampieri and Andrea Schaerf. Modelling and solving the italian examination timetabling problem using tabu search. In A. Rudova, editor, Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling (PATAT 2006), pages 487--491, August 30th - September 1st 2006. [ bib ]
[23]
Andrea Schaerf and Luca Di Gaspero. Measurability and reproducibility in timetabling research: State-of-the-art and discussion. In Hana Rudova, editor, Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling (PATAT 2006), pages 53--62, August 30 - September 1 2006. Invited paper. [ bib ]
[24]
Luca Di Gaspero, Andrea Schaerf, and Marco Chiarandini. A study on the short-term prohibition mechanisms in tabu search for examination timetabling. In Ana Rudova, editor, Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling (PATAT 2006), pages 406--411, August 30 - September 1 2006. [ bib ]
[25]
Luca Di Gaspero, Marco Chiarandini, and Andrea Schaerf. A study on the short-term prohibition mechanisms in tabu search. In Proceedings of the 17th European Conference on Artificial Intelligence (ECAI2006), pages 83--87, Riva del Garda, Italy, August 28th-September 1st 2006. IOS Press. [ bib ]
[26]
Luca Di Gaspero and Andrea Schaerf. Tabu search techniques for the traveling tournament problem. In Proceedings of the 21st European Conference on Operational Research (EURO 2006), page 172, Reykjavik, Iceland, July 2--5 2006. Extended abstract of the talk. [ bib ]
[27]
Luca Di Gaspero and Andrea Schaerf. A tabu search approach to the traveling tournament problem. In Proceedings of the 6th Metaheuristics International Conference (MIC-2005), Vienna, Austria, August 2005. Available as electronic proceedings. [ bib ]
[28]
Luca Di Gaspero, Stefano Mizzaro, and Andrea Schaerf. A multiagent architecture for distributed course timetabling. In Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2004), Pittsburgh (PA), USA, August 2004. [ bib | .pdf ]
[29]
Luca Di Gaspero and Andrea Schaerf. A multineighbourhood local search solver for the timetabling competition ttcomp-2002. In Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2004), Pittsburgh (PA), USA, 2004. [ bib ]
[30]
Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. A hybrid network flow tabu search heuristic for the minimum shift design problem. In Proceedings of the 5th Metaheuristics International Conference (MIC-2003), Kyoto, Japan, August 2003. Available as electronic proceedings. [ bib ]
[31]
Luca Di Gaspero, Jgor Vian, and Andrea Schaerf. A review of neighborhood structures for the job-shop scheduling problem. In Proceedings of the Quadriennal International Conference on Operations Research (OR2002), Klagenfurt, Austria, August 2002. Extended abstract of the talk. [ bib ]
[32]
Luca Di Gaspero and Andrea Schaerf. Multi-neighbourhood local search for course timetabling. In E. Burke and P. De Causmaecker, editors, Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2002), pages 128--132, Gent, Belgium, August 2002. [ bib ]
[33]
Luca Di Gaspero and Andrea Schaerf. EasyLocal++: an object-oriented framework for the flexible design of local search algorithms and metaheuristics. In Proceedings of the 4th Metaheuristics International Conference (MIC-2001), volume 2, pages 287--292, Porto, Portugal, July 2001. [ bib ]
[34]
Marco Cadoli and Andrea Schaerf. Compiling program specifications into sat. In David Sands, editor, Proceedings of 10th European Symposium on Programming (ESOP 2001), volume 2028 of Lecture Notes in Computer Science, pages 387--401, Berlin-Heidelberg, Germany, 2001. Springer Verlag. [ bib ]
[35]
Andrea Schaerf and Luca Di Gaspero. Local search techniques for educational timetabling problems. In L. Lenart, L. Zadnik Stirn, and S. Drobne, editors, Proceedings of the 6th International Symposium on Operations Research in Slovenia (SOR-01), pages 13--23, Preddvor, Slovenia, 2001. Invited paper. [ bib ]
[36]
Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. Local search for shift design. In Proceedings of the 4th Metaheuristics International Conference (MIC-2001), pages 465--469, Porto, Portugal, 2001. [ bib ]
[37]
Luca Di Gaspero and Andrea Schaerf. Tabu search techniques for examination timetabling. In E. Burke and W. Erben, editors, Proceedings of the 3rd International Conference on Practice and Theory of Automated Timetabling (PATAT-2000), pages 176--179, Konstanz, Germany, August 2000. [ bib ]
[38]
Marco Chiarandini, Andrea Schaerf, and Fabio Tiozzo. Solving employee timetabling problems with flexible workload using tabu search. In Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT-2000), pages 298--302, Konstanz, Germany, 2000. [ bib | .pdf ]
[39]
Andrea Schaerf, Maurizio Lenzerini, and Marco Cadoli. Local++: A C++ framework for combinatorial search problems. In Proceedings of the 29th International Conference on Technology of Object-Oriented Languages and Systems (TOOLS-99), pages 152--161, Nancy, France, 1999. An extended version appeared in Software --- Practice & Experience. [ bib ]
[40]
Andrea Schaerf and Amnon Meisels. Solving employee timetabling problems by generalized local search. In Proceedings of the 6th Italian Conference on Artificial Intelligence (AIIA-99), volume 1792 of Lecture Notes in Computer Science, pages 493--502, Berlin-Heidelberg, Germany, 1999. Springer Verlag. [ bib ]
[41]
Krzysztof R. Apt and Andrea Schaerf. Search and imperative programming. In Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-97), pages 67--79, Paris, France, 1997. [ bib ]
[42]
Andrea Schaerf. Combining local search and look-ahead for scheduling and constraint satisfaction problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 1254--1259, Nagoya, Japan, 1997. Morgan-Kaufmann. [ bib | .pdf ]
[43]
Andrea Schaerf. Tabu search techniques for large high-school timetabling problems. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 363--368, Portland (OR), USA, 1996. AAAI Press/MIT Press. [ bib ]
[44]
Andrea Schaerf. Scheduling sport tournaments using constraint logic programming. In Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96), pages 634--639, Budapest, Hungary, 1996. John Wiley and Sons. An unabridged version appeared in CONSTRAINTS journal. [ bib ]
[45]
Andrea Schaerf and Marco Schaerf. Local search techniques for high school timetabling. In Proceedings of the 1st International Conference on the Practice and Theory of Automated Timetabling (ICPTAT-95), pages 313--323, Edinburgh, UK, 1995. Napier University. [ bib ]

Workshop papers

[1]
Sara Ceschia and Andrea Schaerf. Patient admission scheduling with operating room constraints. In Proceedings of the 38th annual meeting of the EURO working group on OR Applied to Health Services (ORAHS 2012), Enschede, the Netherlands, 2012. [ bib ]
[2]
Sara Ceschia and Andrea Schaerf. Multi-neighborhood local search for the patient admission problem. In Maria Blesa et al., editor, 6th Int. Workshop on Hybrid Metaheuristics (HM-2009), volume 5818 of Lecture Notes in Computer Science, pages 156--170, Udine, Italy, 16--17 October 2009. Springer. [ bib ]
[3]
Sara Ceschia and Andrea Schaerf. Hybrid local search techniques for 3-dimensional packing. In 6th ESICUP Meeting, Valencia, Spain, 25--27 March 2009. [ bib ]
[4]
Luca Di Gaspero, Andrea Roli, and Andrea Schaerf. Easyanalyzer: an object-oriented frameowrk for the experimental analysis of stochastic local search algorithms. In Marco Gavanelli and Toni Mancini, editors, Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2008. Available as electronic proceedings. [ bib ]
[5]
Ruggero Bellio, Luca Di Gaspero, and Andrea Schaerf. A statistical analysis of the features of a dynamic tabu search algorithm for course timetabling problems. In Marco Gavanelli and Toni Mancini, editors, Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2008. Available as electronic proceedings. [ bib ]
[6]
Luca Di Gaspero, Barry McCollum, and Andrea Schaerf. The second international timetabling competition (itc-2007): Curriculum-based course timetabling (track 3). In Federico Pecora and Nicola Policella, editors, Proceedings of the 1st International Workshop on Scheduling a Scheduling Competition (SSC 2007), Providence (RI), USA, September 22--27 2007. [ bib | .pdf ]
[7]
Luca Di Gaspero, Barry McCollum, and Andrea Schaerf. The second international timetabling competition (itc-2007): Curriculum-based course timetabling track. In Marco Gavanelli and Toni Mancini, editors, Proceedings of the 14th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, Rome, Italy, July, 5-6 2007. Available as electronic proceedings. [ bib | .pdf ]
[8]
Luca Di Gaspero, Giacomo Di Tollo, Andrea Schaerf, and Andrea Roli. A hybrid solver for constrained portfolio selection problems: preliminary report. In Proceedings of Learning and Intelligent OptimizatioN (LION2007), February, 12th--18th 2007. [ bib | .pdf ]
[9]
Igor Pesek, Andrea Schaerf, and Janez Zerovnik. Hybrid local search techniques for the resource-constrained project scheduling problem. In Hybrid Metaheuristics, pages 57--68, 2007. [ bib | .pdf ]
[10]
Luca Di Gaspero, Marco Chiarandini, and Andrea Schaerf. A study on the short-term prohibition mechanisms in tabu search. In Atti della Giornata di Lavoro del gruppo RCRA 2006: Analisi sperimentale e benchmark di algoritmi per l'Intelligenza Artificiale, June 23 2006. Available as electronic proceedings. [ bib ]
[11]
Luca Di Gaspero, Stefano Mizzaro, and Andrea Schaerf. A multiagent architecture for distributed course timetabling. In In Proceedings of the 6th International Workshop on Distributed Constraint Reasoning (DCR-05), pages 87--100, July 30 2005. [ bib | .pdf ]
[12]
Luca Di Gaspero and Andrea Schaerf. A tabu search approach to the traveling tournament problem. In Marco Cadoli, Marco Gavanelli, and Toni Mancini, editors, Atti della Giornata di Lavoro del gruppo RCRA 2005: Analisi sperimentale e benchmark di algoritmi per l'Intelligenza Artificiale, number CS-2005-03 in Computer Science Group Technical Reports, pages 23--27, Dipartimento di Ingegneria, Università di Ferrara, Italy, June 2005. Available as electronic proceedings. [ bib | .pdf ]
[13]
Luca Di Gaspero, Stefano Mizzaro, and Andrea Schaerf. A multiagent architecture for distributed course timetabling. In Atti della Giornata di Lavoro del gruppo RCRA 2004: Agenti e Vincoli: Modelli e Tecnologie per Dominare la Complessità, 2004. Available as electronic proceedings. [ bib ]
[14]
Krzysztof R. Apt and Andrea Schaerf. Programming in Alma-0, or imperative and declarative programming reconciled. In Dov M. Gabbay and Maarten de Rijke, editors, Proceedings of Frontiers of Combining Systems 2, pages 1--16. Research Studies Press Ltd, 2000. Invited paper. [ bib | .pdf ]
[15]
Marco Cadoli, Luigi Palopoli, Andrea Schaerf, and Domenico Vasile. np-spec: An executable specification language for solving all problems in np. In Gopal Gupta, editor, Proceedings of the 1st International Workshop on Practical Aspects of Declarative Languages (PADL-99), volume 1551 of Lecture Notes in Computer Science, Berlin-Heidelberg, Germany, 1999. Springer Verlag. [ bib ]

Ph.D. thesis

[1]
Andrea Schaerf. Query answering in concept-based knowledge representation systems: algorithms, complexity, and sematic issues. PhD thesis, Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, 1994. [ bib | .pdf ]

Technical reports

[1]
Luca Di Gaspero, Barry McCollum, and Andrea Schaerf. The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3). Technical Report QUB/IEEE/Tech/ITC2007/CurriculumCTT/v1.0, Queen's University, Belfast, United Kingdom, August 2007. [ bib ]
[2]
Luca Di Gaspero and Andrea Schaerf. A case-study for EasyLocal++: the course timetabling problem. Technical Report UDMI/13/2001/RR, Dipartimento di Matematica e Informatica -- Università di Udine, 2001. [ bib | http ]
[3]
Luca Di Gaspero and Andrea Schaerf. EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Technical Report UDMI/13/2000/RR, Dipartimento di Matematica e Informatica -- Università di Udine, 2000. [ bib | http ]
[4]
Andrea Schaerf, Maurizio Lenzerini, and Marco Cadoli. Local++: A C++ framework for local search algorithms. Technical Report 11--99, Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Rome, Italy, 1999. Appeared in Software --- Practice & Experience. [ bib ]
[5]
Krzysztof R. Apt, Jacob Brunekreef, Vincent Partington, and Andrea Schaerf. Alma-0: An imperative language that supports declarative programming. Technical report, CWI - The Netherlands National Research Institute for Mathematics and Computer Science, Amsterdam, The Netherlands, 1997. [ bib ]
[6]
Andrea Schaerf. Scheduling sport tournaments using constraint logic programming. Probability Network and Applications PNA-R9707, CWI - The Netherlands National Research Institute for Mathematics and Computer Science, Amsterdam, The Netherlands, 1997. A revised version appeared in CONSTRAINTS journal. [ bib ]
[7]
Andrea Schaerf. A survey of automated timetabling. Computer Science/Department of Software Technology CS-R9567, CWI - The Netherlands National Research Institute for Mathematics and Computer Science, Amsterdam, The Netherlands, 1996. Appeared in Artificial Intelligence Review. [ bib ]
[8]
Andrea Schaerf. Tabu search techniques for large high-school timetabling problems. Computer Science/Department of Software Technology CS-R9611, CWI - The Netherlands National Research Institute for Mathematics and Computer Science, Amsterdam, The Netherlands, 1996. A revised version appeared in IEEE Transactions on Systems, Man and Cybernetics: Part A. [ bib ]

Other publications

[1]
Sara Ceschia, Nguyen Dang Thi Thanh, Patrick De Causmaecker, Stefaan Haspeslagh, and Andrea Schaerf. Second international nurse rostering competition (INRC-II) - problem description and rules -. CoRR. ArXiv e-prints, 2015. [ bib | http ]
[2]
Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf, and Tommaso Urli. Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. CoRR. ArXiv e-prints, 2014. [ bib | http ]
[3]
Andrea Schaerf and Luca Di Gaspero. Automatic timetabling in healthcare organisations. Private Hospital Healthcare Europe, 2007. [ bib ]
[4]
Pablo Moscato and Andrea Schaerf. Local search techniques for scheduling problems, 1998. Notes of the tutorial given at the 13th European Conference on Artificial Intelligence (ECAI-98). [ bib | .pdf ]

Links