Andrea Schaerf

Sara Ceschia, Andrea Schaerf: Local search for a multi-drop multi-container loading problem. J. Heuristics 19(2): 275-294 (2013)

Alex Bonutti, Fabio De Cesco, Luca Di Gaspero, Andrea Schaerf: Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results. Annals OR 194(1): 59-70 (2012)

Sara Ceschia, Andrea Schaerf: Modeling and solving the dynamic patient admission scheduling problem under uncertainty. Artificial Intelligence in Medicine 56(3): 199-205 (2012)

Sara Ceschia, Luca Di Gaspero, Andrea Schaerf: Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Computers & OR 39(7): 1615-1624 (2012)

Marco Chiarandini, Luca Di Gaspero, Stefano Gualandi, Andrea Schaerf: The balanced academic curriculum problem revisited. J. Heuristics 18(1): 119-148 (2012)

Ruggero Bellio, Luca Di Gaspero, Andrea Schaerf: Design and statistical analysis of a hybrid local search algorithm for course timetabling. J. Scheduling 15(1): 49-61 (2012)

Sara Ceschia, Andrea Schaerf: Local search and lower bounds for the patient admission scheduling problem. Computers & OR 38(10): 1452-1463 (2011)

Sara Ceschia, Luca Di Gaspero, Andrea Schaerf: Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. J. Scheduling 14(6): 601-615 (2011)

Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, Andrea Schaerf: Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings. LION 2011: 450-453

Andrea Schaerf: A Survey of Multi-Agent Systems for Optimization Problems. WOA 2011: 1

Sara Ceschia, Luca Di Gaspero, Andrea Schaerf: Design, Engineering, and . CoRR abs/1104.2518 (2011)

Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhydian Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke: Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. INFORMS Journal on Computing 22(1): 120-130 (2010)

Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, Wolfgang Slany: A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem. Hybrid Metaheuristics 2010: 46-61

Sara Ceschia, Andrea Schaerf: Multi-neighborhood Local Search for the Patient Admission Problem. Hybrid Metaheuristics 2009: 156-170

Maria J. Blesa, Christian Blum, Luca Di Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf (Eds.): Hybrid Metaheuristics, 6th International Workshop, HM 2009, Udine, Italy, October 16-17, 2009. Proceedings. Lecture Notes in Computer Science 5818, Springer 2009, isbn 978-3-642-04917-0

Luca Di Gaspero, Andrea Schaerf: Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem. Hybrid Metaheuristics 2008: 146-157

Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany: The minimum shift design problem. Annals OR 155(1): 79-105 (2007)

Luca Di Gaspero, Andrea Schaerf: A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heuristics 13(2): 189-207 (2007)

Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, Andrea Schaerf: Hybrid Local Search for Constrained Financial Portfolio Selection Problems. CPAIOR 2007: 44-58

Igor Pesek, Andrea Schaerf, Janez Zerovnik: Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem. Hybrid Metaheuristics 2007: 57-68

Luca Di Gaspero, Andrea Roli, Andrea Schaerf: EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms. SLS 2007: 76-90

Luca Di Gaspero, Andrea Schaerf: EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms. SLS 2007: 177-181

Luca Di Gaspero, Andrea Schaerf: Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems. J. Math. Model. Algorithms 5(1): 65-89 (2006)

Luca Di Gaspero, Marco Chiarandini, Andrea Schaerf: A Study on the Short-Term Prohibition Mechanisms in Tabu Search. ECAI 2006: 83-87

Andrea Schaerf, Luca Di Gaspero: Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals. PATAT 2006: 40-49

Marco Cadoli, Andrea Schaerf: : Compiling problem specifications into SAT. Artif. Intell. 162(1-2): 89-120 (2005)

Nysret Musliu, Andrea Schaerf, Wolfgang Slany: Local search for shift design. European Journal of Operational Research 153(1): 51-64 (2004)

Luca Di Gaspero, Andrea Schaerf: The course timetabling problem: theory and practice. Intelligenza Artificiale 1(3): 47-54 (2004)

Amnon Meisels, Andrea Schaerf: Modelling and Solving Employee Timetabling Problems. Ann. Math. Artif. Intell. 39(1-2): 41-59 (2003)

Luca Di Gaspero, Andrea Schaerf: EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms. Softw., Pract. Exper. 33(8): 733-765 (2003)

Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany: The Minimum Shift Design Problem: Theory and Practice. ESA 2003: 593-604

Luca Di Gaspero, Andrea Schaerf: Multi-neighbourhood Local Search with Application to Course Timetabling. PATAT 2002: 262-275

Marco Cadoli, Andrea Schaerf: Compiling Problem Specifications into SAT. ESOP 2001: 387-401

Andrea Schaerf: Local Search Techniques for Constrained Portfolio Selection Problems. CoRR cs.CE/0104017 (2001)

Marco Cadoli, Giovambattista Ianni, Luigi Palopoli, Andrea Schaerf, Domenico Vasile: NP-SPEC: an executable specification language for solving all problems in NP. Comput. Lang. 26(2-4): 165-195 (2000)

Andrea Schaerf, Marco Cadoli, Maurizio Lenzerini: LOCAL++: A C++ framework for local search algorithms. Softw., Pract. Exper. 30(3): 233-257 (2000)

Luca Di Gaspero, Andrea Schaerf: Tabu Search Techniques for Examination Timetabling. PATAT 2000: 104-117

Krzysztof R. Apt, Andrea Schaerf: Programming in Alma-0, or Imperative and Declarative Programming Reconciled. CoRR cs.LO/0004002 (2000)

Andrea Schaerf: A Survey of Automated Timetabling. Artif. Intell. Rev. 13(2): 87-127 (1999)

Andrea Schaerf: Scheduling Sport Tournaments using Constraint Logic Programming. Constraints 4(1): 43-65 (1999)

Andrea Schaerf: Local search techniques for large high school timetabling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part A 29(4): 368-377 (1999)

Andrea Schaerf, Amnon Meisels: Solving Employee Timetabling Problems by Generalized Local Search. AI*IA 1999: 380-389

Krzysztof R. Apt, Andrea Schaerf: The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming. Correct System Design 1999: 89-113

Marco Cadoli, Luigi Palopoli, Andrea Schaerf, Domenico Vasile: NP-SPEC: An Executable Specification Language for Solving All Problems in NP. PADL 1999: 16-30

Andrea Schaerf, Maurizio Lenzerini, Marco Cadoli: LOCAL++: A C++ Framework for Local Search Algorithms. TOOLS (29) 1999: 152-161

Krzysztof R. Apt, Andrea Schaerf: The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming. CoRR cs.LO/9907027 (1999)

Martin Buchheit, Francesco M. Donini, Werner Nutt, Andrea Schaerf: A Refined Architecture for Terminological Systems: Terminology = Schema + Views. Artif. Intell. 99(2): 209-260 (1998)

Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt, Andrea Schaerf: An Epistemic Operator for Description Logics. Artif. Intell. 100(1-2): 225-274 (1998)

Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf: AL-log: Integrating Datalog and Description Logics. J. Intell. Inf. Syst. 10(3): 227-252 (1998)

Krzysztof R. Apt, Jacob Brunekreef, Vincent Partington, Andrea Schaerf: Alma-O: An Imperative Language That Supports Declarative Programming. ACM Trans. Program. Lang. Syst. 20(5): 1014-1066 (1998)

Andrea Schaerf: Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems. IJCAI 1997: 1254-1259

Krzysztof R. Apt, Andrea Schaerf: Search and Imperative Programming. POPL 1997: 67-79

Andrea Schaerf: Tabu Search Techniques for Large High-School Timetabling Problems. AAAI/IAAI, Vol. 1 1996: 363-368

Andrea Schaerf: Scheduling Sport Tournaments using Constraint Logic Programming. ECAI 1996: 634-638

Andrea Schaerf, Yoav Shoham, Moshe Tennenholtz: Adaptive Load Balancing: A Study in Multi-Agent Learning. J. Artif. Intell. Res. (JAIR) 2: 475-500 (1995)

Andrea Schaerf, Yoav Shoham, Moshe Tennenholtz: Adaptive Load Balancing: A Study in Multi-Agent Learning. CoRR cs.AI/9505102 (1995)

Andrea Schaerf: Reasoning with Individuals in Concept Languages. Data Knowl. Eng. 13(2): 141-176 (1994)

Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf: Deduction in Concept Languages: From Subsumption to Instance Checking. J. Log. Comput. 4(4): 423-452 (1994)

Martin Buchheit, Werner Nutt, Francesco M. Donini, Andrea Schaerf: Refining the Structure of Terminological Systems: Terminology = Schema + Views. AAAI 1994: 199-204

Martin Buchheit, Francesco M. Donini, Werner Nutt, Andrea Schaerf: Terminological Systems Revisited: Terminology = Schema + Views. KRDB 1994

Martin Buchheit, Francesco M. Donini, Andrea Schaerf: Decidable Reasoning in Terminological Knowledge Representation Systems. J. Artif. Intell. Res. (JAIR) 1: 109-138 (1993)

Andrea Schaerf: On the Complexity of the Instance Checking Problem in Concept Languages with Existential Quantification. J. Intell. Inf. Syst. 2(3): 265-278 (1993)

Andrea Schaerf: Reasoning with Individuals in Concept Languages. AI*IA 1993: 108-119

Martin Buchheit, Francesco M. Donini, Andrea Schaerf: Decidable Reasoning in Terminological Knowledge Representation Systems. IJCAI 1993: 704-709

Andrea Schaerf: On the Complexity of the Instance Checking Problem in Concept Languages with Existential Quantification. ISMIS 1993: 508-517

Martin Buchheit, Francesco M. Donini, Andrea Schaerf: Decidable Reasoning in Terminological Knowledge Representation Systems. CoRR cs.AI/9312101 (1993)

Andrea Schaerf: On the Role of Subsumption Algorithms in Concept Description Languages. Description Logics 1992: 86-97

Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt, Andrea Schaerf: Queries, Rules and Definitions as Epistemic Sentences in Concept Languages. ECAI Workshop on Knowledge Representation and Reasoning 1992: 113-132

Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf, Werner Nutt: Adding Epistemic Operators to Concept Languages. KR 1992: 342-353

Maurizio Lenzerini, Andrea Schaerf: Concept Languages as Query Languages. AAAI 1991: 471-476

Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf: A Hybrid System with Datalog and Concept Languages. AI*IA 1991: 88-97

Maurizio Lenzerini, Andrea Schaerf: Querying Concept-based Knowledge Bases. PDK 1991: 107-123