Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

449 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (2012, methodology): “In this section, we report the computational comparison of the exact methods of Jepsen et al. (2008) (hereafter called JPSP), Desaulniers et al. (2008) (DHL) and Baldacci et al. (in press) (BMR) on six classes of instances (C1, RC1, R1, C2, RC2 and R2) (see Solomon, 1987).”
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows (2009, result): “For the CVRP the best results have been obtained by Fukasawa et al. (2006) and Baldacci et al. (2008), while the best results for the VRPTW have been presented by Jepsen et al. (2008) and Desaulniers et al. (2008).”
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (2014, methodology): “As in [Jepsen et al., 2008, Desaulniers et al., 2008], we consider only the subsets involving three constraints (1b).”
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem (2011, methodology): “Similar methods have been used by Righini and Salani (2008), Jepsen et al. (2008), and Desaulniers et al. (2008).”