An exact algorithm for the pickup and delivery problem with time windows R Baldacci, E Bartolini, A Mingozzi Operations research 59 (2), 414-426, 2011 | 166 | 2011 |

An exact algorithm for the period routing problem R Baldacci, E Bartolini, A Mingozzi, A Valletta Operations research 59 (1), 228-241, 2011 | 104 | 2011 |

An exact solution framework for a broad class of vehicle routing problems R Baldacci, E Bartolini, A Mingozzi, R Roberti Computational Management Science 7 (3), 229-268, 2010 | 103 | 2010 |

Some applications of the generalized vehicle routing problem R Baldacci, E Bartolini, G Laporte Journal of the Operational Research Society 61 (7), 1072-1077, 2010 | 101 | 2010 |

An Exact Algorithm for the Green Vehicle Routing Problem J Andelmin, E Bartolini Transportation Science 51 (4), 1288-1303, 2017 | 56 | 2017 |

Improved lower bounds and exact algorithm for the capacitated arc routing problem E Bartolini, JF Cordeau, G Laporte Mathematical Programming 137 (1-2), 409-452, 2013 | 56 | 2013 |

The fixed charge transportation problem: An exact algorithm based on a new integer programming formulation R Roberti, E Bartolini, A Mingozzi Management Science 61 (6), 1275-1291, 2014 | 35 | 2014 |

A multi-start local search heuristic for the Green Vehicle Routing Problem based on a multigraph reformulation J Andelmin, E Bartolini Computers & Operations Research 109, 43-63, 2019 | 30 | 2019 |

An exact algorithm for the capacitated arc routing problem with deadheading demand E Bartolini, JF Cordeau, G Laporte Operations Research 61 (2), 315-327, 2013 | 18 | 2013 |

Algorithms for the non-bifurcated network design problem E Bartolini, A Mingozzi Journal of Heuristics 15 (3), 259-281, 2009 | 16 | 2009 |

A two-commodity flow formulation for the capacitated truck-and-trailer routing problem E Bartolini, M Schneider Discrete Applied Mathematics, 2018 | 9 | 2018 |

The traveling salesman problem with pickup, delivery, and ride‐time constraints E Bartolini, L Bodin, A Mingozzi Networks 67 (2), 95-110, 2016 | 5 | 2016 |

Algorithms for network design and routing problems E Bartolini Alma Mater Studiorum Università di Bologna. Dottorato di ricerca in Informatica, 2009 | 2 | 2009 |

The traveling salesman problem with pickup, delivery and ride-time constraints: Detailed computational results E Bartolini, L Bodin, A Mingozzi Technical report, 2015, Department of Mathematics and Systems Analysis …, 2015 | 1 | 2015 |

An Adaptive Memory-Based Approach Based on Partial Enumeration E Bartolini, V Maniezzo, A Mingozzi International Conference on Learning and Intelligent Optimization, 12-24, 2007 | 1 | 2007 |

The Crop Growth Planning Problem in Vertical Farming A Santini, E Bartolini, M Schneider, VG de Lemos European Journal of Operational Research, 2021 | | 2021 |

The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty E Bartolini, D Goeke, M Schneider, M Ye Transportation Science, 2020 | | 2020 |

Scheduling cleaning activities on trains by minimizing idle times E Bartolini, M Dell’Amico, M Iori Journal of Scheduling 20 (5), 493-506, 2017 | | 2017 |