This paper presents an improved version of the solution method that won the inventory routing problemtrack of the 12th DIMACS Implementation Challenge. The solution method is a branch-and-cut embeddedmatheuristic where a matheuristic is called every time new primal solution is found in a...