Alberto Santini

About

I am a Marie Skłodowska-Curie Fellow (Cofund EUTOPIA) at Grande École ESSEC, part of CY Cergy Paris Université.

While my fellowship is ongoing, I am on leave from a position as tenure-track assistant professor at Universitat Pompeu Fabra in Barcelona, Spain.

I am an affiliate professor at the Barcelona Graduate School of Mathematics, the Barcelona Graduate School of Economics and CY Advanced Studies.

I am a lecturer at the Barcelona School of Management and at RWTH Business School.

I founded AIROYoung and EUROYoung, two chapters brining together young Operational Researchers in Italy and Europe, respectively.

• Curriculum Vitæ
• Google Scholar Profile
• Github Profile
• Contact: alberto@santini.in

Publications

• Delorme, M. & Santini, A. (2021). Energy-efficient automated vertical farms. Submitted.
  • Preprint
  • Repository
• Santini, A., Schneider, M., Vidal, T., & Vigo, D. (2021). Decomposition strategies for vehicle routing heuristics. Submitted.
  • Preprint
• Monaci, M., Pike-Burke, C., & Santini, A. (2021). Exact algorithms for the 0-1 time-bomb knapsack problem. Submitted.
  • Preprint
  • Repository
• Santini, A., Viana, A., Klimentova, X., & Pedroso, J.P. (2021). The probabilistic travelling salesman problem with crowdsourcing. Submitted.
  • Preprint
  • Repository
• Santini, A., Schneider, M., Bartolini, E., & Lemos, V. (2021). The crop growth scheduling problem in vertical farming. European Journal of Operational Research.
  • Preprint
  • Repository
• Blum, C., Djukanovic, M., Santini, A., Jiang, H., Li, C.M., Manyà, F., & Raidl, G. (2021). Solving common longest subsequence problems via a transformation to the maximum clique problem. Computers & Operations Research, 125.
  • Preprint
• Santini, A. (2021). Optimising the assignment of swabs and reagents for PCR testing during a viral epidemic. Omega, 102.
  • Preprint
  • Repository
  • Website
• Cornaz, D., Furini, F., Malaguti, E., & Santini, A. (2019). A note on selective line-graphs and partition colorings. Operations Research Letters, 47, 565–568.
  • Preprint
  • Repository
• Santini, A. (2019). An Adaptive Large Neighbourhood Search algorithm for the Orienteering Problem. Expert Systems with Applications, 123, 154–167.
  • Preprint
  • Repository
• Santini, A., Ropke, S., & Hvattum, L. (2018). A comparison of acceptance criteria for the Adaptive Large Neighbourhood Search metaheuristic. Journal of Heuristics, 24, 783–815.
  • Preprint
• Malaguti, E., Martello, S., & Santini, A. (2018). The Traveling Salesman Problem with Pickups, Deliveries, and Draft Limits. Omega, 74, 50–58.
  • Preprint
  • Repository
• Furini, F., Malaguti, E., & Santini, A. (2018). An Exact Algorithm for the Partition Coloring Problem. Computers & Operations Research, 92, 170–181.
  • Preprint
  • Repository
• Santini, A., Ropke, S., & Plum, C. (2017). A branch-and-price approach to the Feeder Network Design Problem. European Journal of Operational Research, 264, 607–622.
  • Preprint
  • Repository
• Bettinelli, A., Santini, A., & Vigo, D. (2017). A real-time conflict solution algorithm for the Train Rescheduling Problem. Transportation Research Part B: Methodological, 106, 237–265.
  • Preprint
  • Repository
• Santini, A., Friberg, H., & Ropke, S. (2015). A note on a model for quay crane scheduling with non-crossing constraints. Engineering Optimization, 47(6), 860–865.
  • Preprint

Resources

• Companies working in Operational Research in Italy.
• PhD courses in Operational Research at Italian universities.
• Example use of the CPLEX C++ API.
• Example implementation of a Genetic Algorithm in C++.
• Example implementation of the Adaptive Large Neighbourhood Search in C++.
• Example implementation of a Biased Random-Key Genetic Algorithm in C++.
• Notes for the Italian State exam for chartered shipbroker (in Italian).