Alberto Santini

According to our database, Alberto Santini authored at least 18 papers between 2018 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Algorithms and complexity results for the 0-1 knapsack problem with group fairness.

Enrico Malaguti, Paolo Paronuzzi, Alberto Santini

Optim. Lett., April, 2026

Recent developments in location-routing problems.

Rossana Cavagnini, Alberto Santini, Michael Schneider, Murwan Siddig

Eur. J. Oper. Res., 2026

Recent developments in location-routing problems.

Rossana Cavagnini, Alberto Santini, Michael Schneider

Eur. J. Oper. Res., 2026

2025

Destination selection and flight scheduling for regional airlines at slot-constrained airports.

Alberto Santini

Int. Trans. Oper. Res., May, 2025

Tactical workforce sizing and scheduling decisions for last-mile delivery.

Minakshi Punam Mandal, Alberto Santini, Claudia Archetti

Eur. J. Oper. Res., 2025

Integrating public transport in sustainable last-mile delivery: Column generation approaches.

Diego Delle Donne, Alberto Santini, Claudia Archetti

Eur. J. Oper. Res., 2025

2024

The min-Knapsack problem with compactness constraints and applications in statistics.

Alberto Santini, Enrico Malaguti

Eur. J. Oper. Res., January, 2024

2023

The hazardous orienteering problem.

Alberto Santini, Claudia Archetti

Networks, March, 2023

Decomposition Strategies for Vehicle Routing Heuristics.

Alberto Santini, Michael Schneider, Thibaut Vidal, Daniele Vigo

INFORMS J. Comput., 2023

2022

The Probabilistic Travelling Salesman Problem with Crowdsourcing.

Alberto Santini, Ana Viana, Xenia Klimentova, João Pedro Pedroso

Comput. Oper. Res., 2022

Exact algorithms for the 0-1 Time-Bomb Knapsack Problem.

Michele Monaci, Ciara Pike-Burke, Alberto Santini

Comput. Oper. Res., 2022

2021

The crop growth planning problem in vertical farming.

Alberto Santini, Enrico Bartolini, Michael Schneider, Vinicius Greco de Lemos

Eur. J. Oper. Res., 2021

Solving longest common subsequence problems via a transformation to the maximum clique problem.

Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl

Comput. Oper. Res., 2021

2019

A note on selective line-graphs and partition colorings.

Denis Cornaz, Fabio Furini, Enrico Malaguti, Alberto Santini

Oper. Res. Lett., 2019

An adaptive large neighbourhood search algorithm for the orienteering problem.

Alberto Santini

Expert Syst. Appl., 2019

2018

A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic.

Alberto Santini, Stefan Ropke, Lars Magnus Hvattum

J. Heuristics, 2018

A branch-and-price approach to the feeder network design problem.

Alberto Santini, Christian E. M. Plum, Stefan Ropke

Eur. J. Oper. Res., 2018

An exact algorithm for the Partition Coloring Problem.

Fabio Furini, Enrico Malaguti, Alberto Santini

Comput. Oper. Res., 2018