Daniele Vigo

Research

The scientific and research activities of Daniele Vigo have been mainly devoted to the design and analysis of models and algorithms for Combinatorial Optimization problems. In particular, within these researches, aiming at dening and evaluating (both theoretically and experimentally) new algorithms, he has examined the following problems:

• Vehicle Routing Problem and its variants (Capacitated VRP, Asymmetric VRP, VRP with Backhauls ...).
• Traveling Salesman Problem and its variants (with pickup and delivery).
• Crew Scheduling and Crew Rostering.
• Bin Packing in one, two and three dimensions.
• Process allocation and signal compression.
• Machine scheduling problems.
• Urban mobility and freight transportation modelling.
• Optimization of Network design for energy and telecommunication applications.
  

From a methodological point of view the research has considered both exact techniques, based on Dynamic Programming, Branch-and-Bound and Branch-and-Cut, and heuristic and metaheuristic techiques. In recent years Daniele Vigo has also performed a vast activity of literature survey on packing and routing problems. This latter research led to the preparation of several papers and book contributions and in the preparation of an edited book on VRP, with Paolo Toth, published in the Discrete Mathematics and Applications series of S.I.A.M. Daniele Vigo is author of more than 80 papers and book chapters published by the major journals and publishers in the field of Operations Research.