This paper provides integer linear programming formulations for three types of vehicle routing problems. Appropriate relaxations of these formulations lend themselves to efficient treatment: the problems are solved by means of a network algorithm embedded in a branch and bound tree. Computational results are reported for two of these problems.