An Adaptive Memory-Based Approach Based on Partial Enumeration. - Enrico Bartolini; Vittorio Maniezzo; Aristide Mingozzi (LION, 2007)

Algorithms for the non-bifurcated network design problem. - Enrico Bartolini; Aristide Mingozzi (J. Heuristics, 2009)

Algorithms for network design and routing problems. - Enrico Bartolini (2009)

An exact solution framework for a broad class of vehicle routing problems. - Roberto Baldacci; Enrico Bartolini; Aristide Mingozzi; Roberto Roberti (Comput. Manag. Sci., 2010)

Some applications of the generalized vehicle routing problem. - Roberto Baldacci; Enrico Bartolini; Gilbert Laporte (J. Oper. Res. Soc., 2010)

An Exact Algorithm for the Pickup and Delivery Problem with Time Windows. - Roberto Baldacci; Enrico Bartolini; Aristide Mingozzi (Oper. Res., 2011)

An Exact Algorithm for the Period Routing Problem. - Roberto Baldacci; Enrico Bartolini; Aristide Mingozzi; Andrea Valletta (Oper. Res., 2011)

An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand. - Enrico Bartolini; Jean-François Cordeau; Gilbert Laporte (Oper. Res., 2013)

Improved lower bounds and exact algorithm for the capacitated arc routing problem. - Enrico Bartolini; Jean-François Cordeau; Gilbert Laporte (Math. Program., 2013)

The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation. - Roberto Roberti; Enrico Bartolini; Aristide Mingozzi (Manag. Sci., 2015)

The traveling salesman problem with pickup, delivery, and ride-time constraints. - Enrico Bartolini; Lawrence Bodin; Aristide Mingozzi (Networks, 2016)

Scheduling cleaning activities on trains by minimizing idle times. - Enrico Bartolini; Mauro Dell'Amico; Manuel Iori (J. Sched., 2017)

An Exact Algorithm for the Green Vehicle Routing Problem. - Juho Andelmin; Enrico Bartolini (Transp. Sci., 2017)

A multi-start local search heuristic for the Green Vehicle Routing Problem based on a multigraph reformulation. - Juho Andelmin; Enrico Bartolini (Comput. Oper. Res., 2019)

A two-commodity flow formulation for the capacitated truck-and-trailer routing problem. - Enrico Bartolini; Michael Schneider 004 (Discret. Appl. Math., 2020)

The crop growth planning problem in vertical farming. - Alberto Santini; Enrico Bartolini; Michael Schneider 004; Vinicius Greco de Lemos (Eur. J. Oper. Res., 2021)

The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty. - Enrico Bartolini; Dominik Goeke; Michael Schneider 004; Mengdie Ye (Transp. Sci., 2021)

A conceptually simple algorithm for the capacitated location-routing problem. - Maximilian Löffler; Enrico Bartolini; Michael Schneider 004 (EURO J. Comput. Optim., 2023)

A general variable neighborhood search for the traveling salesman problem with time windows under various objectives. - Mengdie Ye; Enrico Bartolini; Michael Schneider 004 (Discret. Appl. Math., 2024)