In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These include some polyhedral results and related branch and cut algorithms, and new relaxations. Some of the most significant developments will be presented, together with indications on their computational value.