Showing papers by "Daniele Vigo published in 2002"

TL;DR: This paper reviews the exact algorithms based on the branch and bound approach proposed in the last years for the solution of the basic version of the vehicle routing problem (VRP), where only the vehicle capacity constraints are considered, and concludes by examining possible future directions of research in this field.

TL;DR: This work surveys recent advances obtained for the two-dimensional bin packing problem, with special emphasis on exact algorithms and effective heuristic and metaheuristic approaches.

TL;DR: A Tabu Search framework is introduced exploiting a new constructive heuristic for the evaluation of the neighborhood of 3BP, showing the effectiveness of the approach with respect to exact and heuristic algorithms from the literature.