In this paper we consider the Capacitated Arc Routing Problem with Time windows. We suggest two algorithms for solving the problem to optimality and a heuristic for obtaining high quality solutions. To our knowledge this is the first paper to consider optimal solution of that problem.

We present two new methods to stabilize column-generation algorithms for the Temporal Knapsack Problem (TKP). Caprara et al. [Caprara A, Furini F, and Malaguti E (2013) Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. INFORMS J. on Comp. 25(3):560–571] were the first to...