We consider a problem where customers dynamically request next-day home service, e.g., repair or instalment. Unlike attended home delivery, customers cannot select a time window (TW), but the service provider assigns a next-day TW to each new customer if the customer can feasibly be inserted in...

This paper provides a review of the recent developments that had a major impact on the current state-of-the-art exact algorithms for the vehicle routing problem (VRP). The paper reviews mathematical formulations, relaxations and recent exact methods for two of the most important variants of the...