| A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic A Santini, S Ropke, LM Hvattum Journal of Heuristics 24 (5), 783-815, 2018 | 89 | 2018 |
| A real-time conflict resolution algorithm for the train rescheduling problem A Bettinelli, A Santini, D Vigo Transportation Research Part B: Methodological 106, 237-265, 2017 | 74 | 2017 |
| An Adaptive Large Neighbourhood Search Algorithm for the Orienteering Problem A Santini Expert Systems With Applications 123, 154-167, 2019 | 46 | 2019 |
| The traveling salesman problem with pickups, deliveries, and draft limits E Malaguti, S Martello, A Santini Omega 74, 50-58, 2017 | 37 | 2017 |
| A Branch-and-Price Approach to the Feeder Network Design Problem A Santini, CEM Plum, S Ropke European Journal of Operational Research 264 (2), 607-622, 2017 | 32 | 2017 |
| The Crop Growth Planning Problem in Vertical Farming A Santini, E Bartolini, M Schneider, VG de Lemos European Journal of Operational Research 294 (1), 377-390, 2021 | 28 | 2021 |
| Optimising the assignment of swabs and reagents for PCR testing during a viral epidemic A Santini Omega 102, 102341, 2020 | 27 | 2020 |
| An Exact Algorithm for the Partition Coloring Problem F Furini, E Malaguti, A Santini Computers and Operations Research 92, 170-181, 2017 | 27 | 2017 |
| The Probabilistic Travelling Salesman Problem with Crowdsourcing A Santini, A Viana, X Klimentova, JP Pedroso Computers & Operations Research 142, 105722, 2022 | 26 | 2022 |
| Energy-efficient Automated Vertical Farms M Delorme, A Santini Omega 109, 102611, 2022 | 25 | 2022 |
| Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem C Blum, M Djukanovic, A Santini, H Jiang, CM Li, F Manyà, GR Raidl Computers & Operations Research 125, 105089, 2021 | 25 | 2021 |
| Decomposition strategies for vehicle routing heuristics A Santini, M Schneider, T Vidal, D Vigo INFORMS Journal on Computing 35 (3), 543-559, 2023 | 20 | 2023 |
| A note on a model for quay crane scheduling with non-crossing constraints A Santini, HA Friberg, S Ropke Engineering Optimization 47 (6), 860-865, 2015 | 10 | 2015 |
| Exact algorithms for the 0–1 Time-bomb Knapsack Problem M Monaci, C Pike-Burke, A Santini Computers & Operations Research 145, 105848, 2022 | 6 | 2022 |
| Parallel adaptive large neighbourhood search S Ropke, A Santini Technical Report OR-16-11, 2016 | 5 | 2016 |
| Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search R Turkeš, K Sörensen, LM Hvattum, E Barrena, H Chentli, LC Coelho, ... Data in Brief 33, 106568, 2020 | 4 | 2020 |
| The min-Knapsack Problem with Compactness Constraints and Applications in Statistics A Santini, E Malaguti European Journal of Operational Research 312 (1), 385-397, 2024 | 2 | 2024 |
| The Hazardous Orienteering Problem A Santini, C Archetti Networks 81 (2), 235-252, 2023 | 2 | 2023 |
| Optimisation tools for the COVID-19 pandemic A Santini GIthub repository, 2020 | 2 | 2020 |
| Selective Graph Colouring and Max-Weight Selective Graph Colouring A Santini Github repository, 2017 | 2* | 2017 |
Stefan RopkeTechnical University of Denmark, Department of Management Engineeringdtu.dk의 이메일 확인됨