Alberto Santini

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 12

Top Topics

Neighbourhood Search

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Oper. Res. Lett.

Publications

Alberto Santini, Enrico Malaguti
The min-Knapsack problem with compactness constraints and applications in statistics. Eur. J. Oper. Res. 312 (1) (2024)
Alberto Santini, Michael Schneider, Thibaut Vidal, Daniele Vigo
Decomposition Strategies for Vehicle Routing Heuristics. INFORMS J. Comput. 35 (3) (2023)
Alberto Santini, Claudia Archetti
The hazardous orienteering problem. Networks 81 (2) (2023)
Michele Monaci, Ciara Pike-Burke, Alberto Santini
Exact algorithms for the 0-1 Time-Bomb Knapsack Problem. Comput. Oper. Res. 145 (2022)
Alberto Santini, Ana Viana, Xenia Klimentova, João Pedro Pedroso
The Probabilistic Travelling Salesman Problem with Crowdsourcing. Comput. Oper. Res. 142 (2022)
Alberto Santini, Enrico Bartolini, Michael Schneider, Vinicius Greco de Lemos
The crop growth planning problem in vertical farming. Eur. J. Oper. Res. 294 (1) (2021)
Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl
Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125 (2021)
Alberto Santini
An adaptive large neighbourhood search algorithm for the orienteering problem. Expert Syst. Appl. 123 (2019)
Denis Cornaz, Fabio Furini, Enrico Malaguti, Alberto Santini
A note on selective line-graphs and partition colorings. Oper. Res. Lett. 47 (6) (2019)
Alberto Santini, Stefan Ropke, Lars Magnus Hvattum
A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic. J. Heuristics 24 (5) (2018)
Alberto Santini, Christian E. M. Plum, Stefan Ropke
A branch-and-price approach to the feeder network design problem. Eur. J. Oper. Res. 264 (2) (2018)
Fabio Furini, Enrico Malaguti, Alberto Santini
An exact algorithm for the Partition Coloring Problem. Comput. Oper. Res. 92 (2018)