Abstract

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

摘要

流时间网络恢复问题是由 Averbakh 和 Pereira ( 2012) 提出的 Averbakh, I和Pereira, J. ( 2012 ) Flowtime 网络建设问题。IIE 交易, 44 , 681 – 694。[Taylor & Francis Online]、[Web of Science®]  、[Google Scholar] )，他们提出了最小生成树启发式算法、两个本地搜索程序和一个精确的分支定界算法。本笔记更正了 Averbakh 和 Pereira (2012) 中的计算结果 Averbakh, I和Pereira, J. ( 2012 ) Flowtime 网络建设问题。IIE 交易, 44 , 681 – 694。[Taylor & Francis Online]、[Web of Science®]  、[Google Scholar]）。