Search the dblp DataBase

Publications of Author

1. Michel Gendreau, Gilbert Laporte, Daniele Vigo
   Heuristics for the traveling salesman problem with pickup and delivery. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 1999, v:26, n:7, pp:699-714 [Journal]
   
2. Mauro Dell'Amico, Silvano Martello, Daniele Vigo
   A lower bound for the non-oriented two-dimensional bin packing problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:118, n:1-2, pp:13-24 [Journal]
   
3. Mauro Dell'Amico, Silvano Martello, Daniele Vigo
   Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1995, v:63, n:1, pp:25-41 [Journal]
   
4. Andrea Lodi, Silvano Martello, Daniele Vigo
   Recent advances on two-dimensional bin packing problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:379-396 [Journal]
   
5. Paolo Toth, Daniele Vigo
   Models, relaxations and exact approaches for the capacitated vehicle routing problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:487-512 [Journal]
   
6. Daniele Vigo, Vittorio Maniezzo
   A Genetic/Tabu Thresholding Hybrid Algorithm for the Process Allocation Problem. [Citation Graph (0, 0)][DBLP]
   J. Heuristics, 1997, v:3, n:2, pp:91-110 [Journal]
   
7. Silvano Martello, Michele Monaci, Daniele Vigo
   An Exact Approach to the Strip-Packing Problem. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2003, v:15, n:3, pp:310-319 [Journal]
   
8. Paolo Toth, Daniele Vigo
   The Granular Tabu Search and Its Application to the Vehicle-Routing Problem. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2003, v:15, n:4, pp:333-346 [Journal]
   
9. Andrea Lodi, Silvano Martello, Daniele Vigo
   Models and Bounds for Two-Dimensional Level Packing Problems. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2004, v:8, n:3, pp:363-379 [Journal]
   
10. Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida
    Algorithms for railway crew management. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:79, n:, pp:125-141 [Journal]
    
11. Matteo Fischetti, Daniele Vigo
    A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:1, pp:55-67 [Journal]
    
12. 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. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1998, v:28, n:1, pp:49-76 [Journal]
    
13. Enrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo
    Lower bounds and heuristics for the Windy Rural Postman Problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:176, n:2, pp:855-869 [Journal]
    
14. Andrea Lodi, Silvano Martello, Daniele Vigo
    Heuristic algorithms for the three-dimensional bin packing problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:410-420 [Journal]
    
15. 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. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 2007, v:33, n:1, pp:7- [Journal]
    
16. 
    Recent advances in vehicle routing exact algorithms. [Citation Graph (, )][DBLP]
    
    
17. 
    An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. [Citation Graph (, )][DBLP]