Multi-neighborhood Local Search for the Patient Admission Problem. - Sara Ceschia; Andrea Schaerf (Hybrid Metaheuristics, 2009)

Local search and lower bounds for the patient admission scheduling problem. - Sara Ceschia; Andrea Schaerf (Comput. Oper. Res., 2011)

Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. - Sara Ceschia; Luca Di Gaspero; Andrea Schaerf (J. Sched., 2011)

Modeling and solving the dynamic patient admission scheduling problem under uncertainty. - Sara Ceschia; Andrea Schaerf (Artif. Intell. Medicine, 2012)

Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. - Sara Ceschia; Luca Di Gaspero; Andrea Schaerf (Comput. Oper. Res., 2012)

Local search algorithms for integrated logistic. - Sara Ceschia (2012)

Local search algorithms for integrated logistics. - Sara Ceschia (AI Commun., 2013)

Local search techniques for a routing-packing problem. - Sara Ceschia; Andrea Schaerf; Thomas Stützle (Comput. Ind. Eng., 2013)

Local search for a multi-drop multi-container loading problem. - Sara Ceschia; Andrea Schaerf (J. Heuristics, 2013)

The generalized balanced academic curriculum problem with heterogeneous classes. - Sara Ceschia; Luca Di Gaspero; Andrea Schaerf (Ann. Oper. Res., 2014)

Second International Nurse Rostering Competition (INRC-II) - Problem Description and Rules -. - Sara Ceschia; Nguyen Dang Thi Thanh; Patrick De Causmaecker; Stefaan Haspeslagh; Andrea Schaerf (CoRR, 2015)

Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. - Ruggero Bellio; Sara Ceschia; Luca Di Gaspero; Andrea Schaerf; Tommaso Urli (Comput. Oper. Res., 2016)

Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. - Sara Ceschia; Andrea Schaerf (J. Sched., 2016)

Modeling and solving a real-life multi-skill shift design problem. - Alex Bonutti; Sara Ceschia; Fabio De Cesco; Nysret Musliu; Andrea Schaerf (Ann. Oper. Res., 2017)

Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming. - Sara Ceschia; Luca Di Gaspero; Andrea Schaerf (Comput. Ind. Eng., 2017)

The Second International Nurse Rostering Competition. - Sara Ceschia; Nguyen Dang 001; Patrick De Causmaecker; Stefaan Haspeslagh; Andrea Schaerf (Ann. Oper. Res., 2019)

Modelling and solving the thesis defense timetabling problem. - Michele Battistutta; Sara Ceschia; Fabio De Cesco; Luca Di Gaspero; Andrea Schaerf (J. Oper. Res. Soc., 2019)

Local Search and Constraint Programming for a Real-World Examination Timetabling Problem. - Michele Battistutta; Sara Ceschia; Fabio De Cesco; Luca Di Gaspero; Andrea Schaerf; Elena Topan (CPAIOR, 2020)

Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods. - Sara Ceschia; Rosita Guido; Andrea Schaerf (Ann. Oper. Res., 2020)

Energy-efficient frozen food transports: the Refrigerated Routing Problem. - Antonella Meneghetti; Sara Ceschia (Int. J. Prod. Res., 2020)

Modeling and solving the steelmaking and casting scheduling problem. - Davide Armellini; Paolo Borzone; Sara Ceschia; Luca Di Gaspero; Andrea Schaerf (Int. Trans. Oper. Res., 2020)

Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling. - Ruggero Bellio; Sara Ceschia; Luca Di Gaspero; Andrea Schaerf (Comput. Oper. Res., 2021)

Solving a home energy management problem by Simulated Annealing. - Edoardo Bastianetto; Sara Ceschia; Andrea Schaerf (Optim. Lett., 2021)

Simulated Annealing for the Home Healthcare Routing and Scheduling Problem. - Sara Ceschia; Luca Di Gaspero; Andrea Schaerf (AI*IA, 2022)

Metaheuristic Algorithms for UAV Trajectory Optimization in Mobile Networks. - Valentina Cacchiani; Sara Ceschia; Silvia Mignardi; Chiara Buratti (MIC, 2022)

Local Search for Integrated Predictive Maintenance and Scheduling in Flow-Shop. - Andrea Ecoretti; Sara Ceschia; Andrea Schaerf (MIC, 2022)

Task design in complex crowdsourcing experiments: Item assignment optimization. - Sara Ceschia; Kevin Roitero; Gianluca Demartini; Stefano Mizzaro; Luca Di Gaspero; Andrea Schaerf (Comput. Oper. Res., 2022)

Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem. - Sara Ceschia; Luca Di Gaspero; Roberto Maria Rosati; Andrea Schaerf (EURO J. Comput. Optim., 2022)

Correction to: Solving a home energy management problem by Simulated Annealing. - Edoardo Bastianetto; Sara Ceschia; Andrea Schaerf (Optim. Lett., 2022)

Reinforcement Learning for Multi-Neighborhood Local Search in Combinatorial Optimization. - Sara Ceschia; Luca Di Gaspero; Roberto Maria Rosati; Andrea Schaerf (LOD (2), 2023)

Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities. - Marcelo Rodrigues de Holanda Maia; Miguel Reula; Consuelo Parreño-Torres; Prem Prakash Vuppuluri; Alexandre Plastino 001; Uéverton S. Souza; Sara Ceschia; Mario Pavone; Andrea Schaerf (Soft Comput., 2023)

The on-demand warehousing problem. - Sara Ceschia; Margaretha Gansterer; Simona Mancini; Antonella Meneghetti (Int. J. Prod. Res., 2023)

Educational timetabling: Problems, benchmarks, and state-of-the-art results. - Sara Ceschia; Luca Di Gaspero; Andrea Schaerf (Eur. J. Oper. Res., 2023)

Exact and metaheuristic methods for a real-world examination timetabling problem. - Mats Carlsson; Sara Ceschia; Luca Di Gaspero; Rasmus Ø. Mikkelsen; Andrea Schaerf; Thomas Jacob Riis Stidsen (J. Sched., 2023)

Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling. - Sara Ceschia; Luca Di Gaspero; Simona Mancini; Vittorio Maniezzo; Roberto Montemanni; Roberto Maria Rosati; Andrea Schaerf (MIC (1), 2024)

Solving the Integrated Patient-to-Room and Nurse-to-Patient Assignment by Simulated Annealing. - Eugenia Zanazzo; Sara Ceschia; Andrea Schaerf (MIC (1), 2024)

EasyLocal++ a 25-year Perspective on Local Search Frameworks: The Evolution of a Tool for the Design of Local Search Algorithm. - Sara Ceschia; Francesca Da Ros; Luca Di Gaspero; Andrea Schaerf (GECCO Companion, 2024)

Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities. - Sara Ceschia; Andrea Schaerf (Comput. Ind. Eng., 2024)

Solving the Online On-Demand Warehousing Problem. - Sara Ceschia; Margaretha Gansterer; Simona Mancini; Antonella Meneghetti (Comput. Oper. Res., 2024)

A compact model for the home healthcare routing and scheduling problem. - Roberto Montemanni; Sara Ceschia; Andrea Schaerf (EURO J. Comput. Optim., 2025)

Solving the medical student scheduling problem using simulated annealing. - Eugenia Zanazzo; Sara Ceschia; Agostino Dovier; Andrea Schaerf (J. Sched., 2025)