Lateness Minimization in Pairwise Connectivity Restoration Problems

References

• Ahuja R, Magnanti T, Orlin J (1993) Network Flows (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Averbakh I (2012) Emergency path restoration problems. Discrete Optim. 9(1):58–64.Crossref, Google Scholar
• Averbakh I (2017) Minimizing the makespan in multiserver network restoration problems. Networks 70(1):60–68.Crossref, Google Scholar
• Averbakh I, Pereira J (2012) The flowtime network construction problem. IIE Trans. 44(8):681–694.Crossref, Google Scholar
• Averbakh I, Pereira J (2015) Network construction problems with due dates. Eur. J. Oper. Res. 244(3):715–729.Crossref, Google Scholar
• Baxter M, Elgindy T, Ernst A, Kalinowski T, Savelsbergh M (2014) Incremental network design with shortest paths. Eur. J. Oper. Res. 238(3):675–684.Crossref, Google Scholar
• Beasley J (1989) An SST-based algorithm for the Steiner problem in graphs. Networks 19(1):1–16.Crossref, Google Scholar
• Chilean Ministry of Public Works (2010) Informe de seguimiento del programa de emergencia y reconstrucción de infraestructura del ministerio de obras públicas, December 2010. Technical report, Government of Chile, Santiago.Google Scholar
• Chilean Ministry of Public Works (2011) Informe de reconstrucción, MOP, 4 de febrero del 2011. Technical report, Government of Chile, Santiago.Google Scholar
• Engel K, Kalinowski T, Savelsbergh M (2017) Incremental network design with minimum spanning trees. J. Graph Algorithms Appl. 21(4):417–432.Crossref, Google Scholar
• Garey M, Johnson D (1979) Computers and Intractability (Freeman, New York).Google Scholar
• Guha S, Moss A, Naor J, Schieber B (1999) Efficient recovery from power outage (extended abstract). Vitter J, Larmore L, Leighton T, eds. Proc. Thirty-First Annual ACM Sympos. Theory Comput. STOC ’99 (Association for Computing Machinery, New York), 574–582.Google Scholar
• Kalinowski T, Matsypura D, Savelsbergh M (2015) Incremental network design with maximum flows. Eur. J. Oper. Res. 242(1):51–62.Crossref, Google Scholar
• Nurre S, Sharkey T (2014) Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules. Networks 63(4):306–326.Crossref, Google Scholar
• Nurre S, Cavdaroglu B, Mitchell J, Sharkey T, Wallace W (2012) Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem. Eur. J. Oper. Res. 223(3):794–806.Crossref, Google Scholar
• Shore M, Foulds L, Gibbons P (1982) An algorithm for the Steiner problem in graphs. Networks 12(3):323–333.Crossref, Google Scholar
• Sousa J, Wolsey L (1992) A time indexed formulation of non-preemptive single machine scheduling problems. Math. Programming 54(1):353–367.Crossref, Google Scholar
• West D (1996) Introduction to Graph Theory (Prentice-Hall, Upper Saddle River, NJ).Google Scholar