A note on the flowtime network restoration problem
本文纠正了Averbakh和Pereira（2012）关于流时间网络修复问题的计算结果的错误，该问题涉及最小生成树启发式、局部搜索和精确分支定界算法。
The flowtime network restoration problem was introduced by Averbakh and Pereira (2012 Averbakh, I and Pereira, J. (2012) The flowtime network construction problem. IIE Transactions, 44, 681–694.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) 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 Averbakh, I and Pereira, J. (2012) The flowtime network construction problem. IIE Transactions, 44, 681–694.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]).