| 2008 |
|---|
| 16 | EE | Marco A. Boschetti,
Aristide Mingozzi,
Salvatore Ricciardelli:
A dual ascent procedure for the set partitioning problem.
Discrete Optimization 5(4): 735-747 (2008) |
| 15 | EE | 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 |
|---|
| 14 | EE | Enrico Bartolini,
Vittorio Maniezzo,
Aristide Mingozzi:
An Adaptive Memory-Based Approach Based on Partial Enumeration.
LION 2007: 12-24 |
| 13 | EE | Daniele Vigo,
Paolo Toth,
Aristide Mingozzi:
Route 2005: Recent advances in vehicle routing optimization.
Networks 49(4): 243-244 (2007) |
| 2006 |
|---|
| 12 | EE | 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 |
|---|
| 11 | EE | Aristide Mingozzi:
The Multi-depot Periodic Vehicle Routing Problem.
SARA 2005: 347-350 |
| 2004 |
|---|
| 10 | EE | 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) |
| 2003 |
|---|
| 9 | EE | 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) |
| 8 | EE | 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) |
| 7 | EE | 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 |
|---|
| 6 | EE | Aristide Mingozzi:
State Space Relaxation and Search Strategies in Dynamic Programming.
SARA 2002: 51 |
| 5 | EE | 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) |
| 4 | | Aristide Mingozzi,
Serena Morigi:
Partitioning a matrix with non-guillotine cuts to minimize the maximum cos.
Discrete Applied Mathematics 116(3): 243-260 (2002) |
| 1999 |
|---|
| 3 | EE | Vittorio Maniezzo,
Aristide Mingozzi:
The project scheduling problem with irregular starting time costs.
Oper. Res. Lett. 25(4): 175-182 (1999) |
| 1998 |
|---|
| 2 | | Vittorio Maniezzo,
Aristide Mingozzi,
Roberto Baldacci:
A Bionomic Approach to the Capacitated p-Median Problem.
J. Heuristics 4(3): 263-280 (1998) |
| 1995 |
|---|
| 1 | EE | Aristide Mingozzi,
Salvatore Ricciardelli,
Massimo Spadoni:
Partitioning a Matrix to Minimize the Maximum Cost.
Discrete Applied Mathematics 62(1-3): 221-248 (1995) |
