Ruolo editoriale nella rivista «4OR Quarterly Journal of the Belgian, French and Italian Operations Research Societies», BERLIN, HEIDELBERG, Springer
Martello S.; Monaci M.; Vigo D., An exact approach to the strip-packing problem, «INFORMS JOURNAL ON COMPUTING», 2003, 15, pp. 310 - 319 [Scientific article]
Dell'Amico M.; Martello S.; Vigo D., A lower bound for the non-oriented two-dimensional bin packing problem, «DISCRETE APPLIED MATHEMATICS», 2002, 118, pp. 13 - 24 [Scientific article]
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 [Scientific article]
Lodi A.; Martello S.; Vigo D., Recent advances on two-dimensional bin packing problems, «DISCRETE APPLIED MATHEMATICS», 2002, 123, pp. 379 - 396 [Scientific article]
Lodi A.; Martello S.; Monaci M., Two-dimensional packing problems: A survey, «EUROPEAN JOURNAL OF OPERATIONAL RESEARCH», 2002, 141, pp. 241 - 252 [Scientific article]
Fischetti M.; Lodi A.; Martello S.; Toth P., A polyhedral approach to simplified crew scheduling and vehicle scheduling problems, «MANAGEMENT SCIENCE», 2001, 47, pp. 833 - 850 [Scientific article]
Dell'Amico M.; Lodi A.; Martello S., Efficient algorithms and codes for k-cardinality assignment problems, «DISCRETE APPLIED MATHEMATICS», 2001, 110, pp. 25 - 40 [Scientific article]
Martello S.; Pisinger D.; Vigo D., Three-dimensional bin packing problem, «OPERATIONS RESEARCH», 2000, 48, pp. 256 - 267 [Scientific article]
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 [Scientific article]
Martello S.; Vigo D., Exact solution of the two-dimensional finite bin packing problem, «MANAGEMENT SCIENCE», 1998, 44, pp. 388 - 399 [Scientific article]
Dell'Amico M.; Martello S.; Vigo D., Minimizing the sum of weighted completion times with unrestricted weights, «DISCRETE APPLIED MATHEMATICS», 1995, 63, pp. 25 - 41 [Scientific article]
