| 2007 |
|---|
| 19 | EE | Roberto Baldacci,
Paolo Toth,
Daniele Vigo:
Recent advances in vehicle routing exact algorithms.
4OR 5(4): 269-298 (2007) |
| 18 | EE | Silvano Martello,
David Pisinger,
Daniele Vigo,
Edgar den Boef,
Jan H. M. Korst:
Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem.
ACM Trans. Math. Softw. 33(1): 7 (2007) |
| 17 | EE | Enrique Benavent,
Alessandro Carrotta,
Angel Corberán,
José M. Sanchis,
Daniele Vigo:
Lower bounds and heuristics for the Windy Rural Postman Problem.
European Journal of Operational Research 176(2): 855-869 (2007) |
| 16 | EE | Daniele Vigo,
Paolo Toth,
Aristide Mingozzi:
Route 2005: Recent advances in vehicle routing optimization.
Networks 49(4): 243-244 (2007) |
| 2004 |
|---|
| 15 | EE | Andrea Lodi,
Silvano Martello,
Daniele Vigo:
TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems.
Annals OR 131(1-4): 203-213 (2004) |
| 14 | EE | Andrea Lodi,
Silvano Martello,
Daniele Vigo:
Models and Bounds for Two-Dimensional Level Packing Problems.
J. Comb. Optim. 8(3): 363-379 (2004) |
| 2003 |
|---|
| 13 | EE | Silvano Martello,
Michele Monaci,
Daniele Vigo:
An Exact Approach to the Strip-Packing Problem.
INFORMS Journal on Computing 15(3): 310-319 (2003) |
| 12 | EE | Paolo Toth,
Daniele Vigo:
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem.
INFORMS Journal on Computing 15(4): 333-346 (2003) |
| 2002 |
|---|
| 11 | | Mauro Dell'Amico,
Silvano Martello,
Daniele Vigo:
A lower bound for the non-oriented two-dimensional bin packing problem.
Discrete Applied Mathematics 118(1-2): 13-24 (2002) |
| 10 | | Andrea Lodi,
Silvano Martello,
Daniele Vigo:
Recent advances on two-dimensional bin packing problems.
Discrete Applied Mathematics 123(1-3): 379-396 (2002) |
| 9 | | Paolo Toth,
Daniele Vigo:
Models, relaxations and exact approaches for the capacitated vehicle routing problem.
Discrete Applied Mathematics 123(1-3): 487-512 (2002) |
| 8 | EE | Andrea Lodi,
Silvano Martello,
Daniele Vigo:
Heuristic algorithms for the three-dimensional bin packing problem.
European Journal of Operational Research 141(2): 410-420 (2002) |
| 1999 |
|---|
| 7 | EE | Michel Gendreau,
Gilbert Laporte,
Daniele Vigo:
Heuristics for the traveling salesman problem with pickup and delivery.
Computers & OR 26(7): 699-714 (1999) |
| 6 | EE | Filippo Focacci,
Andrea Lodi,
Michela Milano,
Daniele Vigo:
Solving TSP through the Integration of OR and CP Techniques.
Electronic Notes in Discrete Mathematics 1: 13-25 (1999) |
| 1998 |
|---|
| 5 | | Alberto Caprara,
Filippo Focacci,
Evelina Lamma,
Paola Mello,
Michela Milano,
Paolo Toth,
Daniele Vigo:
Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem.
Softw., Pract. Exper. 28(1): 49-76 (1998) |
| 1997 |
|---|
| 4 | | Daniele Vigo,
Vittorio Maniezzo:
A Genetic/Tabu Thresholding Hybrid Algorithm for the Process Allocation Problem.
J. Heuristics 3(2): 91-110 (1997) |
| 3 | | Alberto Caprara,
Matteo Fischetti,
Paolo Toth,
Daniele Vigo,
Pier Luigi Guida:
Algorithms for railway crew management.
Math. Program. 79: 125-141 (1997) |
| 2 | EE | Matteo Fischetti,
Daniele Vigo:
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem.
Networks 29(1): 55-67 (1997) |
| 1995 |
|---|
| 1 | EE | Mauro Dell'Amico,
Silvano Martello,
Daniele Vigo:
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights.
Discrete Applied Mathematics 63(1): 25-41 (1995) |
