Andrea Schaerf
Orcid: 0000-0001-6965-0536
According to our database1,
Andrea Schaerf
authored at least 97 papers
between 1991 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Local search approaches for the test laboratory scheduling problem with variable task grouping.
J. Sched., October, 2023
J. Sched., August, 2023
Eur. J. Oper. Res., July, 2023
Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities.
Soft Comput., 2023
Reinforcement Learning for Multi-Neighborhood Local Search in Combinatorial Optimization.
Proceedings of the Machine Learning, Optimization, and Data Science, 2023
2022
Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021.
J. Sched., 2022
J. Sched., 2022
Algorithm selection and instance space analysis for curriculum-based course timetabling.
J. Sched., 2022
Optim. Lett., 2022
Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem.
EURO J. Comput. Optim., 2022
Comput. Oper. Res., 2022
Proceedings of the Metaheuristics - 14th International Conference, 2022
Construct, Merge, Solve and Adapt Applied to a Bus Driver Scheduling Problem with Complex Break Constraints.
Proceedings of the AIxIA 2022 - Advances in Artificial Intelligence, 2022
Proceedings of the AIxIA 2022 - Advances in Artificial Intelligence, 2022
2021
Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling.
Comput. Oper. Res., 2021
2020
Int. Trans. Oper. Res., 2020
Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods.
Ann. Oper. Res., 2020
Local Search and Constraint Programming for a Real-World Examination Timetabling Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020
2019
J. Oper. Res. Soc., 2019
2017
Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming.
Comput. Ind. Eng., 2017
Ann. Oper. Res., 2017
Feature-based tuning of single-stage simulated annealing for examination timetabling.
Ann. Oper. Res., 2017
2016
Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays.
J. Sched., 2016
Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem.
Comput. Oper. Res., 2016
2015
Second International Nurse Rostering Competition (INRC-II) - Problem Description and Rules -.
CoRR, 2015
2014
Ann. Oper. Res., 2014
Ann. Oper. Res., 2014
2013
Proceedings of the Automated Scheduling and Planning - From Theory to Practice, 2013
2012
Design and statistical analysis of a hybrid local search algorithm for course timetabling.
J. Sched., 2012
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem.
Comput. Oper. Res., 2012
Modeling and solving the dynamic patient admission scheduling problem under uncertainty.
Artif. Intell. Medicine, 2012
Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results.
Ann. Oper. Res., 2012
2011
Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs.
J. Sched., 2011
Comput. Oper. Res., 2011
Proceedings of the 12th Workshop on Objects and Agents, Rende (CS), Italy, Jul 4-6, 2011, 2011
Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011
2010
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition.
INFORMS J. Comput., 2010
Proceedings of the Hybrid Metaheuristics - 7th International Workshop, 2010
2009
Proceedings of the Hybrid Metaheuristics, 6th International Workshop, 2009
2008
A Statistical Analysis of the Features of a Dynamic Tabu Search Algorithm for Course Timetabling Problems.
Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2008
Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem.
Proceedings of the Hybrid Metaheuristics, 5th International Workshop, 2008
2007
J. Heuristics, 2007
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem.
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007
2006
J. Math. Model. Algorithms, 2006
Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006
2005
2004
The course timetabling problem: theory and practice.
Intelligenza Artificiale, 2004
2003
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms.
Softw. Pract. Exp., 2003
Proceedings of the Algorithms, 2003
2002
Proceedings of the Practice and Theory of Automated Timetabling IV, 2002
2001
2000
Comput. Lang., 2000
Proceedings of the Practice and Theory of Automated Timetabling III, 2000
1999
IEEE Trans. Syst. Man Cybern. Part A, 1999
Constraints An Int. J., 1999
Proceedings of the Practical Aspects of Declarative Languages, 1999
Proceedings of the Correct System Design, 1999
Proceedings of the AI*IA 99:Advances in Artificial Intelligence, 1999
1998
ACM Trans. Program. Lang. Syst., 1998
Artif. Intell., 1998
Programming in Alma-0, or Imperative and Declarative Programming Reconciled.
Proceedings of the Frontiers of Combining Systems, Second International Workshop, 1998
1997
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997
Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997
1996
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996
1995
J. Artif. Intell. Res., 1995
1994
J. Log. Comput., 1994
Proceedings of the Reasoning about Structured Objects: Knowledge Representation Meets Databases, 1994
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994
1993
On the Complexity of the Instance Checking Problem in Concept Languages with Existential Quantification.
J. Intell. Inf. Syst., 1993
J. Artif. Intell. Res., 1993
1992
Adding Epistemic Operators to Concept Languages.
Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR'92). Cambridge, 1992
Proceedings of the Foundation of Knowledge Representation and Reasoning [the book grew out of an ECAI-92 workshop], 1992
On the Role of Subsumption Algorithms in Concept Description Languages.
Proceedings of the Issues in Description Logics: Users Meet Developers, 1992
1991
Proceedings of the Processing Declarative Knowledge, 1991
Proceedings of the Trends in Artificial Intelligence, 1991
Proceedings of the 9th National Conference on Artificial Intelligence, 1991