- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j29 |      | Aristide Mingozzi, Roberto Roberti, Paolo Toth: An Exact Algorithm for the Multitrip Vehicle Routing Problem. INFORMS Journal on Computing 25(2): 193-207 (2013) |
| j28 | | Roberto Baldacci, Aristide Mingozzi, Roberto Roberti, Roberto Wolfler Calvo: An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. Operations Research 61(2): 298-314 (2013) |
| 2012 | ||
| j27 | | Roberto Baldacci, Aristide Mingozzi, Roberto Roberti: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research 218(1): 1-6 (2012) |
| j26 | | Roberto Baldacci, Aristide Mingozzi, Roberto Roberti: New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. INFORMS Journal on Computing 24(3): 356-371 (2012) |
| 2011 | ||
| j25 | | Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi, Andrea Valletta: An Exact Algorithm for the Period Routing Problem. Operations Research 59(1): 228-241 (2011) |
| j24 | | Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows. Operations Research 59(2): 414-426 (2011) |
| j23 | | Roberto Baldacci, Aristide Mingozzi, Roberto Roberti: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem. Operations Research 59(5): 1269-1283 (2011) |
| j22 | | Roberto Baldacci, Aristide Mingozzi, Roberto Wolfler Calvo: An Exact Method for the Capacitated Location-Routing Problem. Operations Research 59(5): 1284-1296 (2011) |
| 2009 | ||
| j21 | | Enrico Bartolini, Aristide Mingozzi: Algorithms for the non-bifurcated network design problem. J. Heuristics 15(3): 259-281 (2009) |
| j20 | | Roberto Baldacci, Aristide Mingozzi: A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120(2): 347-380 (2009) |
| 2008 | ||
| j19 | | Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli: A dual ascent procedure for the set partitioning problem. Discrete Optimization 5(4): 735-747 (2008) |
| j18 | | 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): 351-385 (2008) |
| 2007 | ||
| j17 | | Daniele Vigo, Paolo Toth, Aristide Mingozzi: Route 2005: Recent advances in vehicle routing optimization. Networks 49(4): 243-244 (2007) |
| c3 | | Enrico Bartolini, Vittorio Maniezzo, Aristide Mingozzi: An Adaptive Memory-Based Approach Based on Partial Enumeration. LION 2007: 12-24 |
| 2006 | ||
| j16 | | Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi: The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Computers & OR 33: 2667-2702 (2006) |
| 2005 | ||
| c2 | | |
| 2004 | ||
| j15 | | Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli: An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem. Annals OR 127(1-4): 177-201 (2004) |
| j14 | | Roberto Baldacci, Vittorio Maniezzo, Aristide Mingozzi: An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation. Operations Research 52(3): 422-439 (2004) |
| j13 | | Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi: An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation. Operations Research 52(5): 723-738 (2004) |
| 2003 | ||
| j12 | | Marco A. Boschetti, Aristide Mingozzi: The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR 1(1): 27-42 (2003) |
| j11 | | Marco A. Boschetti, Aristide Mingozzi: The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. 4OR 1(2): 135-147 (2003) |
| j10 | | Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi: An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. Networks 42(1): 26-41 (2003) |
| 2002 | ||
| j9 | | Roberto Baldacci, Eleni Hadjiconstantinou, Vittorio Maniezzo, Aristide Mingozzi: A new method for solving capacitated location problems based on a set partitioning approach. Computers & OR 29(4): 365-386 (2002) |
| j8 | | Aristide Mingozzi, Serena Morigi: Partitioning a matrix with non-guillotine cuts to minimize the maximum cos. Discrete Applied Mathematics 116(3): 243-260 (2002) |
| c1 | | Aristide Mingozzi: State Space Relaxation and Search Strategies in Dynamic Programming. SARA 2002: 51 |
| 2000 | ||
| j7 | | Lawrence Bodin, Aristide Mingozzi, Roberto Baldacci, Michael O. Ball: The Rollon-Rolloff Vehicle Routing Problem. Transportation Science 34(3): 271-288 (2000) |
| 1999 | ||
| j6 | | Vittorio Maniezzo, Aristide Mingozzi: The project scheduling problem with irregular starting time costs. Oper. Res. Lett. 25(4): 175-182 (1999) |
| j5 | | Aristide Mingozzi, Simone Giorgi, Roberto Baldacci: An Exact Method for the Vehicle Routing Problem with Backhauls. Transportation Science 33(3): 315-329 (1999) |
| 1998 | ||
| j4 | | Vittorio Maniezzo, Aristide Mingozzi, Roberto Baldacci: A Bionomic Approach to the Capacitated p-Median Problem. J. Heuristics 4(3): 263-280 (1998) |
| 1995 | ||
| j3 | | Aristide Mingozzi, Salvatore Ricciardelli, Massimo Spadoni: Partitioning a Matrix to Minimize the Maximum Cost. Discrete Applied Mathematics 62(1-3): 221-248 (1995) |
| 1993 | ||
| j2 | | Lucio Bianco, Aristide Mingozzi, Salvatore Ricciardelli: The traveling salesman problem with cumulative costs. Networks 23(2): 81-91 (1993) |
| 1981 | ||
| j1 | | Nicos Christofides, Aristide Mingozzi, Paolo Toth: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2): 145-164 (1981) |
Data released under the ODC-BY 1.0 license — See also our legal information page