  In this work we compare several new computational approaches to an inventory
routing problem, in which a single product is shipped from a warehouse to
retailers via an uncapacitated vehicle. We survey exact algorithms for the
Traveling Salesman Problem (TSP) and its relaxations in the literature for the
routing component. For the inventory control component we survey classical
mixed integer linear programming and shortest path formulations for inventory
models. We present a numerical study comparing combinations of the two
empirically in terms of cost and solution time.
