A note on the flowtime network restoration problem

Yaarit Miriam Cohen, Pinar Keskinocak, Jordi Pereira

Research output: Contribution to journalArticlepeer-review


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).

Original languageEnglish
Pages (from-to)1351-1352
Number of pages2
JournalIISE Transactions
Issue number12
StatePublished - 2021
Externally publishedYes


  • Scheduling
  • deliveryman problem
  • emergency restoration operations
  • network construction planning
  • traveling repairman problem


Dive into the research topics of 'A note on the flowtime network restoration problem'. Together they form a unique fingerprint.

Cite this