default search action
Sara Ceschia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j28]Sara Ceschia, Andrea Schaerf:
Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities. Comput. Ind. Eng. 188: 109858 (2024) - [j27]Sara Ceschia, Margaretha Gansterer, Simona Mancini, Antonella Meneghetti:
Solving the Online On-Demand Warehousing Problem. Comput. Oper. Res. 170: 106760 (2024) - [c9]Eugenia Zanazzo, Sara Ceschia, Andrea Schaerf:
Solving the Integrated Patient-to-Room and Nurse-to-Patient Assignment by Simulated Annealing. MIC (1) 2024: 158-163 - [c8]Sara Ceschia, Luca Di Gaspero, Simona Mancini, Vittorio Maniezzo, Roberto Montemanni, Roberto Maria Rosati, Andrea Schaerf:
Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling. MIC (1) 2024: 164-170 - [c7]Sara Ceschia, Francesca Da Ros, Luca Di Gaspero, Andrea Schaerf:
EasyLocal++ a 25-year Perspective on Local Search Frameworks: The Evolution of a Tool for the Design of Local Search Algorithm. GECCO Companion 2024: 1658-1667 - 2023
- [j26]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Educational timetabling: Problems, benchmarks, and state-of-the-art results. Eur. J. Oper. Res. 308(1): 1-18 (2023) - [j25]Sara Ceschia, Margaretha Gansterer, Simona Mancini, Antonella Meneghetti:
The on-demand warehousing problem. Int. J. Prod. Res. 61(10): 3152-3170 (2023) - [j24]Mats Carlsson, Sara Ceschia, Luca Di Gaspero, Rasmus Ø. Mikkelsen, Andrea Schaerf, Thomas Jacob Riis Stidsen:
Exact and metaheuristic methods for a real-world examination timetabling problem. J. Sched. 26(4): 353-367 (2023) - [j23]Marcelo Rodrigues de Holanda Maia, Miguel Reula, Consuelo Parreño-Torres, Prem Prakash Vuppuluri, Alexandre Plastino, Uéverton S. Souza, Sara Ceschia, Mario Pavone, Andrea Schaerf:
Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities. Soft Comput. 27(8): 4685-4698 (2023) - [c6]Sara Ceschia, Luca Di Gaspero, Roberto Maria Rosati, Andrea Schaerf:
Reinforcement Learning for Multi-Neighborhood Local Search in Combinatorial Optimization. LOD (2) 2023: 206-221 - 2022
- [j22]Sara Ceschia, Kevin Roitero, Gianluca Demartini, Stefano Mizzaro, Luca Di Gaspero, Andrea Schaerf:
Task design in complex crowdsourcing experiments: Item assignment optimization. Comput. Oper. Res. 148: 105995 (2022) - [j21]Sara Ceschia, Luca Di Gaspero, Roberto Maria Rosati, Andrea Schaerf:
Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem. EURO J. Comput. Optim. 10: 100024 (2022) - [j20]Edoardo Bastianetto, Sara Ceschia, Andrea Schaerf:
Correction to: Solving a home energy management problem by Simulated Annealing. Optim. Lett. 16(3): 1103 (2022) - [c5]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Simulated Annealing for the Home Healthcare Routing and Scheduling Problem. AI*IA 2022: 402-412 - [c4]Valentina Cacchiani, Sara Ceschia, Silvia Mignardi, Chiara Buratti:
Metaheuristic Algorithms for UAV Trajectory Optimization in Mobile Networks. MIC 2022: 30-44 - [c3]Andrea Ecoretti, Sara Ceschia, Andrea Schaerf:
Local Search for Integrated Predictive Maintenance and Scheduling in Flow-Shop. MIC 2022: 260-273 - [i4]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Educational Timetabling: Problems, Benchmarks, and State-of-the-Art Results. CoRR abs/2201.07525 (2022) - 2021
- [j19]Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling. Comput. Oper. Res. 132: 105300 (2021) - [j18]Edoardo Bastianetto, Sara Ceschia, Andrea Schaerf:
Solving a home energy management problem by Simulated Annealing. Optim. Lett. 15(5): 1553-1564 (2021) - 2020
- [j17]Sara Ceschia, Rosita Guido, Andrea Schaerf:
Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods. Ann. Oper. Res. 288(1): 95-113 (2020) - [j16]Antonella Meneghetti, Sara Ceschia:
Energy-efficient frozen food transports: the Refrigerated Routing Problem. Int. J. Prod. Res. 58(14): 4164-4181 (2020) - [j15]Davide Armellini, Paolo Borzone, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Modeling and solving the steelmaking and casting scheduling problem. Int. Trans. Oper. Res. 27(1): 57-90 (2020) - [c2]Michele Battistutta, Sara Ceschia, Fabio De Cesco, Luca Di Gaspero, Andrea Schaerf, Elena Topan:
Local Search and Constraint Programming for a Real-World Examination Timetabling Problem. CPAIOR 2020: 69-81
2010 – 2019
- 2019
- [j14]Sara Ceschia, Nguyen Dang, Patrick De Causmaecker, Stefaan Haspeslagh, Andrea Schaerf:
The Second International Nurse Rostering Competition. Ann. Oper. Res. 274(1-2): 171-186 (2019) - [j13]Michele Battistutta, Sara Ceschia, Fabio De Cesco, Luca Di Gaspero, Andrea Schaerf:
Modelling and solving the thesis defense timetabling problem. J. Oper. Res. Soc. 70(7): 1039-1050 (2019) - 2017
- [j12]Alex Bonutti, Sara Ceschia, Fabio De Cesco, Nysret Musliu, Andrea Schaerf:
Modeling and solving a real-life multi-skill shift design problem. Ann. Oper. Res. 252(2): 365-382 (2017) - [j11]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming. Comput. Ind. Eng. 114: 235-243 (2017) - 2016
- [j10]Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf, Tommaso Urli:
Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Comput. Oper. Res. 65: 83-92 (2016) - [j9]Sara Ceschia, Andrea Schaerf:
Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. J. Sched. 19(4): 377-389 (2016) - 2015
- [i3]Sara Ceschia, Nguyen Dang Thi Thanh, Patrick De Causmaecker, Stefaan Haspeslagh, Andrea Schaerf:
Second International Nurse Rostering Competition (INRC-II) - Problem Description and Rules -. CoRR abs/1501.04177 (2015) - 2014
- [j8]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
The generalized balanced academic curriculum problem with heterogeneous classes. Ann. Oper. Res. 218(1): 147-163 (2014) - [i2]Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf, Tommaso Urli:
Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. CoRR abs/1409.7186 (2014) - 2013
- [j7]Sara Ceschia:
Local search algorithms for integrated logistics. AI Commun. 26(3): 325-326 (2013) - [j6]Sara Ceschia, Andrea Schaerf, Thomas Stützle:
Local search techniques for a routing-packing problem. Comput. Ind. Eng. 66(4): 1138-1149 (2013) - [j5]Sara Ceschia, Andrea Schaerf:
Local search for a multi-drop multi-container loading problem. J. Heuristics 19(2): 275-294 (2013) - 2012
- [b1]Sara Ceschia:
Local search algorithms for integrated logistic. University of Udine, Italy, 2012 - [j4]Sara Ceschia, Andrea Schaerf:
Modeling and solving the dynamic patient admission scheduling problem under uncertainty. Artif. Intell. Medicine 56(3): 199-205 (2012) - [j3]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Comput. Oper. Res. 39(7): 1615-1624 (2012) - 2011
- [j2]Sara Ceschia, Andrea Schaerf:
Local search and lower bounds for the patient admission scheduling problem. Comput. Oper. Res. 38(10): 1452-1463 (2011) - [j1]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. J. Sched. 14(6): 601-615 (2011) - [i1]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Design, Engineering, and Experimental Analysis of a Simulated Annealing Approach to the Post-Enrolment Course Timetabling Problem. CoRR abs/1104.2518 (2011)
2000 – 2009
- 2009
- [c1]Sara Ceschia, Andrea Schaerf:
Multi-neighborhood Local Search for the Patient Admission Problem. Hybrid Metaheuristics 2009: 156-170
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint