Luca Di Gaspero
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Luca Di Gaspero has a total of 76 co-authors. Here are the top co-authors by number of shared publications:
- Andrea Schaerf
University of Udine, udine, Italy
41 shared publications - Francesca Da Ros
University of Udine Italy
17 shared publications - Sara Ceschia
Polytechnic Department of Engineering and Architecture, University of Udine, Udine, Italy
17 shared publications - Andrea Roli
University of Bologna
10 shared publications - Kevin Roitero
University of Udine, udine, Italy
8 shared publications - Nysret Musliu
Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling, DBAI, TU Wien, Vienna, Austria
8 shared publications
Latest Publications
- Open Access
- 19 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Behavior and representation in open-weight Large Language Models for combinatorial optimization: From feature extraction to algorithm selection
- 19 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Open AccessBehavior and representation in open-weight Large Language Models for combinatorial optimization: From feature extraction to algorithm selection
- Open Access
- 7 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 195
Revisiting local search for Curriculum-Based Course Timetabling
- 7 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 195
Open AccessRevisiting local search for Curriculum-Based Course Timetabling
- Top Cited PapersOpen Access
- 21 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (11) , 1-53
Large Language Models for Combinatorial Optimization: A Systematic Review
This systematic review explores the application of Large Language Models (LLMs) in Combinatorial Optimization (CO). We report our findings using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines. We conduct a literature search via Scopus and Google Scholar, examining over 2,000 publications. We assess publications against four inclusion and four exclusion criteria related to their language, research focus, publication year, and type. Eventually, we select 103 studies. We classify these studies into semantic categories and topics to provide a comprehensive overview of the field, including the tasks performed by LLMs, the architectures of LLMs, the existing datasets specifically designed for evaluating LLMs in CO, and the field of application. Finally, we identify future directions for leveraging LLMs in this field.
- 21 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (11) , 1-53
Top Cited PapersOpen AccessLarge Language Models for Combinatorial Optimization: A Systematic Review
This systematic review explores the application of Large Language Models (LLMs) in Combinatorial Optimization (CO). We report our findings using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines. We conduct a literature search via Scopus and Google Scholar, examining over 2,000 publications. We assess publications against four inclusion and four exclusion criteria related to their language, research focus, publication year, and type. Eventually, we select 103 studies. We classify these studies into semantic categories and topics to provide a comprehensive overview of the field, including the tasks performed by LLMs, the architectures of LLMs, the existing datasets specifically designed for evaluating LLMs in CO, and the field of application. Finally, we identify future directions for leveraging LLMs in this field.
- Open Access
- 30 December 2025
- Published by Wiley in International Transactions in Operational Research
A unified formulation for home healthcare routing and scheduling problems
Home Healthcare is an essential component of healthcare systems, where caregivers visit patients' homes to deliver services. While presenting advantages with respect to institutional care, such as being cost‐effective and alleviating family burdens, it presents challenges in scheduling and routing caregivers efficiently. While various formulations of such a problem—the home healthcare routing and scheduling problem—have been proposed, many fail to include key real‐world features, limiting their applicability in practice. This paper consolidates relevant features from existing models and significantly extends the formulation by Mankowska et al. (2014) to develop a unified framework incorporating as many real‐world aspects as possible. We introduce a new instance generator, a set of real‐world features to describe these instances, and a comprehensive infrastructure for validating and comparing solutions. Furthermore, we extend two state‐of‐the‐art solution methods—simulated annealing and one based on a compact mixed integer linear programming model solved by a state‐of‐the‐art software – to integrate all these features and provide a comparative analysis of their performance. Results show that our general solution methods are able to outperform methods specialized for a specific formulation on many instances.
- 30 December 2025
- Published by Wiley in International Transactions in Operational Research
Open AccessA unified formulation for home healthcare routing and scheduling problems
Home Healthcare is an essential component of healthcare systems, where caregivers visit patients' homes to deliver services. While presenting advantages with respect to institutional care, such as being cost‐effective and alleviating family burdens, it presents challenges in scheduling and routing caregivers efficiently. While various formulations of such a problem—the home healthcare routing and scheduling problem—have been proposed, many fail to include key real‐world features, limiting their applicability in practice. This paper consolidates relevant features from existing models and significantly extends the formulation by Mankowska et al. (2014) to develop a unified framework incorporating as many real‐world aspects as possible. We introduce a new instance generator, a set of real‐world features to describe these instances, and a comprehensive infrastructure for validating and comparing solutions. Furthermore, we extend two state‐of‐the‐art solution methods—simulated annealing and one based on a compact mixed integer linear programming model solved by a state‐of‐the‐art software – to integrate all these features and provide a comparative analysis of their performance. Results show that our general solution methods are able to outperform methods specialized for a specific formulation on many instances.
- Open Access
Behavior and Representation in Large Language Models for Combinatorial Optimization: From Feature Extraction to Algorithm Selection
Recent advances in Large Language Models (LLMs) have opened new perspectives for automation in optimization. While several studies have explored how LLMs can generate or solve optimization models, far less is understood about what these models actually learn regarding problem structure or algorithmic behavior. This study investigates how LLMs internally represent combinatorial optimization problems and whether such representations can support downstream decision tasks. We adopt a twofold methodology combining direct querying, which assesses LLM capacity to explicitly extract instance features, with probing analyses that examine whether such information is implicitly encoded within their hidden layers. The probing framework is further extended to a per-instance algorithm selection task, evaluating whether LLM-derived representations can predict the best-performing solver. Experiments span four benchmark problems and three instance representations. Results show that LLMs exhibit moderate ability to recover feature information from problem instances, either through direct querying or probing. Notably, the predictive power of LLM hidden-layer representations proves comparable to that achieved through traditional feature extraction, suggesting that LLMs capture meaningful structural information relevant to optimization performance.
Open AccessBehavior and Representation in Large Language Models for Combinatorial Optimization: From Feature Extraction to Algorithm Selection
Recent advances in Large Language Models (LLMs) have opened new perspectives for automation in optimization. While several studies have explored how LLMs can generate or solve optimization models, far less is understood about what these models actually learn regarding problem structure or algorithmic behavior. This study investigates how LLMs internally represent combinatorial optimization problems and whether such representations can support downstream decision tasks. We adopt a twofold methodology combining direct querying, which assesses LLM capacity to explicitly extract instance features, with probing analyses that examine whether such information is implicitly encoded within their hidden layers. The probing framework is further extended to a per-instance algorithm selection task, evaluating whether LLM-derived representations can predict the best-performing solver. Experiments span four benchmark problems and three instance representations. Results show that LLMs exhibit moderate ability to recover feature information from problem instances, either through direct querying or probing. Notably, the predictive power of LLM hidden-layer representations proves comparable to that achieved through traditional feature extraction, suggesting that LLMs capture meaningful structural information relevant to optimization performance.
- Open Access
Large Language Models for Combinatorial Optimization: A Systematic Review
This systematic review explores the application of Large Language Models (LLMs) in Combinatorial Optimization (CO). We report our findings using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines. We conduct a literature search via Scopus and Google Scholar, examining over 2,000 publications. We assess publications against four inclusion and four exclusion criteria related to their language, research focus, publication year, and type. Eventually, we select 103 studies. We classify these studies into semantic categories and topics to provide a comprehensive overview of the field, including the tasks performed by LLMs, the architectures of LLMs, the existing datasets specifically designed for evaluating LLMs in CO, and the field of application. Finally, we identify future directions for leveraging LLMs in this field.
Open AccessLarge Language Models for Combinatorial Optimization: A Systematic Review
This systematic review explores the application of Large Language Models (LLMs) in Combinatorial Optimization (CO). We report our findings using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines. We conduct a literature search via Scopus and Google Scholar, examining over 2,000 publications. We assess publications against four inclusion and four exclusion criteria related to their language, research focus, publication year, and type. Eventually, we select 103 studies. We classify these studies into semantic categories and topics to provide a comprehensive overview of the field, including the tasks performed by LLMs, the architectures of LLMs, the existing datasets specifically designed for evaluating LLMs in CO, and the field of application. Finally, we identify future directions for leveraging LLMs in this field.
- 17 April 2025
- Published by Springer Nature
- p. 68-85
Search Trajectory Networks Applied to a Real-World Parallel Batch Scheduling Problem
- 17 April 2025
- Published by Springer Nature
- p. 68-85
Search Trajectory Networks Applied to a Real-World Parallel Batch Scheduling Problem
- 17 April 2025
- Published by Springer Nature
- p. 353-371
Probing LLMs on Optimization Problems: Can They Recall and Interpret Problem Features?
- 17 April 2025
- Published by Springer Nature
- p. 353-371
Probing LLMs on Optimization Problems: Can They Recall and Interpret Problem Features?
- 18 March 2025
- Published by Springer Nature
- p. 66-83
Instance Space Analysis and Algorithm Selection for a Parallel Batch Scheduling Problem
- 18 March 2025
- Published by Springer Nature
- p. 66-83
Instance Space Analysis and Algorithm Selection for a Parallel Batch Scheduling Problem
- Open Access
- 5 February 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 177
Multi-neighborhood simulated annealing for the oven scheduling problem
- 5 February 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 177
Open AccessMulti-neighborhood simulated annealing for the oven scheduling problem