Aristide Mingozzi

Publication Activity (10 Years)

Years Active: 1980-2018
Publications (10 Years): 2

Top Topics

Vehicle Routing Problem

Exact Algorithms

Integer Programming

Top Venues

INFORMS J. Comput.

Publications

Aristide Mingozzi, Roberto Roberti
An Exact Algorithm for the Fixed Charge Transportation Problem Based on Matching Source and Sink Patterns. Transp. Sci. 52 (2) (2018)
Enrico Bartolini, Lawrence Bodin, Aristide Mingozzi
The traveling salesman problem with pickup, delivery, and ride-time constraints. Networks 67 (2) (2016)
Roberto Roberti, Enrico Bartolini, Aristide Mingozzi
The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation. Manag. Sci. 61 (6) (2015)
Roberto Roberti, Aristide Mingozzi
Dynamic ng-Path Relaxation for the Delivery Man Problem. Transp. Sci. 48 (3) (2014)
Aristide Mingozzi, Roberto Roberti, Paolo Toth
An Exact Algorithm for the Multitrip Vehicle Routing Problem. INFORMS J. Comput. 25 (2) (2013)
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti, Roberto Wolfler Calvo
An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. Oper. Res. 61 (2) (2013)
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24 (3) (2012)
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218 (1) (2012)
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem. Oper. Res. 59 (5) (2011)
Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows. Oper. Res. 59 (2) (2011)
Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi, Andrea Valletta
An Exact Algorithm for the Period Routing Problem. Oper. Res. 59 (1) (2011)
Roberto Baldacci, Aristide Mingozzi, Roberto Wolfler Calvo
An Exact Method for the Capacitated Location-Routing Problem. Oper. Res. 59 (5) (2011)
Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi, Roberto Roberti
An exact solution framework for a broad class of vehicle routing problems. Comput. Manag. Sci. 7 (3) (2010)
Roberto Baldacci, Aristide Mingozzi
A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120 (2) (2009)
Enrico Bartolini, Aristide Mingozzi
Algorithms for the non-bifurcated network design problem. J. Heuristics 15 (3) (2009)
Roberto Baldacci, Nicos Christofides, Aristide Mingozzi
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115 (2) (2008)
Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli
A dual ascent procedure for the set partitioning problem. Discret. Optim. 5 (4) (2008)
Enrico Bartolini, Vittorio Maniezzo, Aristide Mingozzi
An Adaptive Memory-Based Approach Based on Partial Enumeration. LION (2007)
Daniele Vigo, Paolo Toth, Aristide Mingozzi
Route 2005: Recent advances in vehicle routing optimization. Networks 49 (4) (2007)
Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput. Oper. Res. 33 (2006)
Aristide Mingozzi
The Multi-depot Periodic Vehicle Routing Problem. SARA (2005)
Roberto Baldacci, Vittorio Maniezzo, Aristide Mingozzi
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation. Oper. Res. 52 (3) (2004)
Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation. Oper. Res. 52 (5) (2004)
Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli
An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem. Ann. Oper. Res. 127 (1-4) (2004)
Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. Networks 42 (1) (2003)
Marco A. Boschetti, Aristide Mingozzi
The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. 4OR 1 (2) (2003)
Marco A. Boschetti, Aristide Mingozzi
The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR 1 (1) (2003)
Aristide Mingozzi
State Space Relaxation and Search Strategies in Dynamic Programming. SARA (2002)
Aristide Mingozzi, Serena Morigi
Partitioning a matrix with non-guillotine cuts to minimize the maximum cos. Discret. Appl. Math. 116 (3) (2002)
Roberto Baldacci, Eleni Hadjiconstantinou, Vittorio Maniezzo, Aristide Mingozzi
A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29 (4) (2002)
Lawrence Bodin, Aristide Mingozzi, Roberto Baldacci, Michael O. Ball
The Rollon-Rolloff Vehicle Routing Problem. Transp. Sci. 34 (3) (2000)
Aristide Mingozzi, Simone Giorgi, Roberto Baldacci
An Exact Method for the Vehicle Routing Problem with Backhauls. Transp. Sci. 33 (3) (1999)
Aristide Mingozzi, Marco A. Boschetti, Salvatore Ricciardelli, Lucio Bianco
A Set Partitioning Approach to the Crew Scheduling Problem. Oper. Res. 47 (6) (1999)
Vittorio Maniezzo, Aristide Mingozzi
The project scheduling problem with irregular starting time costs. Oper. Res. Lett. 25 (4) (1999)
Vittorio Maniezzo, Aristide Mingozzi, Roberto Baldacci
A Bionomic Approach to the Capacitated p-Median Problem. J. Heuristics 4 (3) (1998)
Aristide Mingozzi, Lucio Bianco, Salvatore Ricciardelli
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints. Oper. Res. 45 (3) (1997)
Eleni Hadjiconstantinou, Nicos Christofides, Aristide Mingozzi
-shortest paths relaxations. Ann. Oper. Res. 61 (1) (1995)
Aristide Mingozzi, Salvatore Ricciardelli, Massimo Spadoni
Partitioning a Matrix to Minimize the Maximum Cost. Discret. Appl. Math. 62 (1-3) (1995)
Lucio Bianco, Aristide Mingozzi, Salvatore Ricciardelli
The traveling salesman problem with cumulative costs. Networks 23 (2) (1993)
Nicos Christofides, Aristide Mingozzi, Paolo Toth
State-space relaxation procedures for the computation of bounds to routing problems. Networks 11 (2) (1981)
Nicos Christofides, Aristide Mingozzi, Paolo Toth
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20 (1) (1981)
Nicos Christofides, Aristide Mingozzi, Paolo Toth
Dynamic Loading and Unloading of Liquids into Tanks. Oper. Res. 28 (3-Part-II) (1980)