Abstract

The flowtime network restoration problem was introduced by Averbakh and Pereira (2012) who presented a Minimum Spanning Tree heuristic, two local search procedures, and an exact branch-and-bound algorithm. This note corrects the computational results in Averbakh and Pereira (2012).