A. LODI; MARTELLO S.; D. VIGO, Tspack: A unified tabu search code for multi-dimensional bin packing problems, «ANNALS OF OPERATIONS RESEARCH», 2004, 131, pp. 203 - 213 [articolo]
Martello S.; Monaci M.; Vigo D., An exact approach to the strip-packing problem, «INFORMS JOURNAL ON COMPUTING», 2003, 15, pp. 310 - 319 [articolo]
Toth P.; Vigo D., The granular tabu search and its application to the vehicle-routing problem, «INFORMS JOURNAL ON COMPUTING», 2003, 15, pp. 333 - 346 [articolo]
Lodi A.; Martello S.; Vigo D., Heuristic algorithms for the three-dimensional bin packing problem, «EUROPEAN JOURNAL OF OPERATIONAL RESEARCH», 2002, 141, pp. 410 - 420 [articolo]
Toth P.; Vigo D., Models, relaxations and exact approaches for the capacitated vehicle routing problem, «DISCRETE APPLIED MATHEMATICS», 2002, 123, pp. 487 - 512 [articolo]
Lodi A.; Martello S.; Vigo D., Recent advances on two-dimensional bin packing problems, «DISCRETE APPLIED MATHEMATICS», 2002, 123, pp. 379 - 396 [articolo]
Martello S.; Pisinger D.; Vigo D., Three-dimensional bin packing problem, «OPERATIONS RESEARCH», 2000, 48, pp. 256 - 267 [articolo]
Lodi A.; Martello S.; Vigo D., Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems, «INFORMS JOURNAL ON COMPUTING», 1999, 11, pp. 345 - 357 [articolo]
Caprara A.; Toth P.; Vigo D.; Fischetti M., Modeling and solving the crew rostering problem, «OPERATIONS RESEARCH», 1998, 46, pp. 820 - 830 [articolo]
Fischetti M.; Vigo D., A Branch-and-Cut Algorithm for the Resource-Constrained Minimum-Weight Arborescence Problem, «NETWORKS», 1997, 29, pp. 55 - 67 [articolo]
Fischetti Matteo; Toth Paolo; Vigo Daniele, Branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs, «OPERATIONS RESEARCH», 1994, 42, pp. 846 - 859 [articolo]
