Dynamic Loading and Unloading of Liquids into Tanks. - Nicos Christofides; Aristide Mingozzi; Paolo Toth (Oper. Res., 1980)

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. - Nicos Christofides; Aristide Mingozzi; Paolo Toth (Math. Program., 1981)

State-space relaxation procedures for the computation of bounds to routing problems. - Nicos Christofides; Aristide Mingozzi; Paolo Toth (Networks, 1981)

The traveling salesman problem with cumulative costs. - Lucio Bianco; Aristide Mingozzi; Salvatore Ricciardelli (Networks, 1993)

A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations. - Eleni Hadjiconstantinou; Nicos Christofides; Aristide Mingozzi (Ann. Oper. Res., 1995)

Partitioning a Matrix to Minimize the Maximum Cost. - Aristide Mingozzi; Salvatore Ricciardelli; Massimo Spadoni (Discret. Appl. Math., 1995)

Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints. - Aristide Mingozzi; Lucio Bianco; Salvatore Ricciardelli (Oper. Res., 1997)

A Bionomic Approach to the Capacitated p-Median Problem. - Vittorio Maniezzo; Aristide Mingozzi; Roberto Baldacci (J. Heuristics, 1998)

A Set Partitioning Approach to the Crew Scheduling Problem. - Aristide Mingozzi; Marco A. Boschetti; Salvatore Ricciardelli; Lucio Bianco (Oper. Res., 1999)

The project scheduling problem with irregular starting time costs. - Vittorio Maniezzo; Aristide Mingozzi (Oper. Res. Lett., 1999)

An Exact Method for the Vehicle Routing Problem with Backhauls. - Aristide Mingozzi; Simone Giorgi; Roberto Baldacci (Transp. Sci., 1999)

The Rollon-Rolloff Vehicle Routing Problem. - Lawrence Bodin; Aristide Mingozzi; Roberto Baldacci; Michael O. Ball (Transp. Sci., 2000)

State Space Relaxation and Search Strategies in Dynamic Programming. - Aristide Mingozzi (SARA, 2002)

A new method for solving capacitated location problems based on a set partitioning approach. - Roberto Baldacci; Eleni Hadjiconstantinou; Vittorio Maniezzo; Aristide Mingozzi (Comput. Oper. Res., 2002)

Partitioning a matrix with non-guillotine cuts to minimize the maximum cos. - Aristide Mingozzi; Serena Morigi (Discret. Appl. Math., 2002)

The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. - Marco A. Boschetti; Aristide Mingozzi (4OR, 2003)

The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. - Marco A. Boschetti; Aristide Mingozzi (4OR, 2003)

An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. - Roberto Baldacci; Eleni Hadjiconstantinou; Aristide Mingozzi (Networks, 2003)

An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem. - Marco A. Boschetti; Aristide Mingozzi; Salvatore Ricciardelli (Ann. Oper. Res., 2004)

An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation. - Roberto Baldacci; Eleni Hadjiconstantinou; Aristide Mingozzi (Oper. Res., 2004)

An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation. - Roberto Baldacci; Vittorio Maniezzo; Aristide Mingozzi (Oper. Res., 2004)

The Multi-depot Periodic Vehicle Routing Problem. - Aristide Mingozzi (SARA, 2005)

The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. - Roberto Baldacci; Lawrence Bodin; Aristide Mingozzi (Comput. Oper. Res., 2006)

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

Route 2005: Recent advances in vehicle routing optimization. - Daniele Vigo; Paolo Toth; Aristide Mingozzi (Networks, 2007)

A dual ascent procedure for the set partitioning problem. - Marco A. Boschetti; Aristide Mingozzi; Salvatore Ricciardelli (Discret. Optim., 2008)

An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. - Roberto Baldacci; Nicos Christofides; Aristide Mingozzi (Math. Program., 2008)

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

A unified exact method for solving different classes of vehicle routing problems. - Roberto Baldacci; Aristide Mingozzi (Math. Program., 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)

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 Method for the Capacitated Location-Routing Problem. - Roberto Baldacci; Aristide Mingozzi; Roberto Wolfler Calvo (Oper. Res., 2011)

New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem. - Roberto Baldacci; Aristide Mingozzi; Roberto Roberti (Oper. Res., 2011)

Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. - Roberto Baldacci; Aristide Mingozzi; Roberto Roberti (Eur. J. Oper. Res., 2012)

New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. - Roberto Baldacci; Aristide Mingozzi; Roberto Roberti (INFORMS J. Comput., 2012)

An Exact Algorithm for the Multitrip Vehicle Routing Problem. - Aristide Mingozzi; Roberto Roberti; Paolo Toth (INFORMS J. Comput., 2013)

An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. - Roberto Baldacci; Aristide Mingozzi; Roberto Roberti; Roberto Wolfler Calvo (Oper. Res., 2013)

Dynamic ng-Path Relaxation for the Delivery Man Problem. - Roberto Roberti; Aristide Mingozzi (Transp. Sci., 2014)

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)

An Exact Algorithm for the Fixed Charge Transportation Problem Based on Matching Source and Sink Patterns. - Aristide Mingozzi; Roberto Roberti (Transp. Sci., 2018)