We consider a continuous-time variant of the inventory-routing problem in which the maximum quantity that can delivered to a customer depends on the customer’s storage capacity and product inventory at the time of the delivery. We investigate critical components of a dynamic discretization discovery algorithm and demonstrate in an extensive computational study that these components are sufficient to produce provably high-quality, often optimal solutions.