Alberto Santini
Alberto Santini
Verified email at upf.edu - Homepage
Title
Cited by
Cited by
Year
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
272017
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
172018
The traveling salesman problem with pickups, deliveries, and draft limits
E Malaguti, S Martello, A Santini
Omega 74, 50-58, 2017
162017
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
122017
An Exact Algorithm for the Partition Coloring Problem
F Furini, E Malaguti, A Santini
Computers and Operations Research 92, 170-181, 2017
112017
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
72015
An Adaptive Large Neighbourhood Search Algorithm for the Orienteering Problem
A Santini
Expert Systems With Applications 123, 154-167, 2019
62019
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
12021
Optimising the assignment of swabs and reagents for PCR testing during a viral epidemic
A Santini
Omega, 2020
2020
A note on selective line-graphs and partition colorings
D Cornaz, F Furini, E Malaguti, A Santini
Operations Research Letters 47 (6), 565-568, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–10