Exact Approaches for Network Design Problems with Relays

References

• Arslan O, Yıldız B, Karaşan OE (2015) Minimum cost path problem for plug-in hybrid electric vehicles. Transportation Res. Part E: Logist. Transportation Rev. 80:123–141.Crossref, Google Scholar
• Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, Google Scholar
• BGL (2016) The boost graph library (BGL). Accessed September 9, 2017, http://www.boost.org/doc/libs/1_63_0/libs/graph/doc/index.html.Google Scholar
• Cabral EA, Erkut E, Laporte G, Patterson RA (2007) The network design problem with relays. Eur. J. Oper. Res. 180(2):834–844.Crossref, Google Scholar
• Campbell JF, O’Kelly ME (2012) Twenty-five years of hub location research. Transportation Sci. 46(2):153–169.Link, Google Scholar
• Capar I, Kuby M, Leon VJ, Tsai Y-J (2013) An arc cover–path-cover formulation and strategic analysis of alternative-fuel station locations. Eur. J. Oper. Res. 227(1):142–151.Crossref, Google Scholar
• Chen S, Ljubić I, Raghavan S (2010) The regenerator location problem. Networks 55(3):205–220.Crossref, Google Scholar
• Chen S, Ljubić I, Raghavan S (2015) The generalized regenerator location problem. INFORMS J. Comput. 27(2):204–220.Link, Google Scholar
• Cherkassy BV, Goldberg AV (1995) On implementing push-relabel method for the maximum flow problem. Balas E, Clausen J, eds. Proc. 4th Internat. IPCO Conf. Integer Programming Combin. Optim., Lecture Notes in Computer Science, Vol. 920 (Springer, Berlin), 157–171.Google Scholar
• Desrosiers J, Lübbecke ME (2011) Branch-price-and-cut algorithms. Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269–271.Crossref, Google Scholar
• Gamrath G, Fischer T, Gally T, Gleixner AM, Hendel G, Koch T, Maher SJet al. (2016) The SCIP optimization suite 3.2. Technical Report 15-60, ZIB, Berlin.Google Scholar
• Gendron B, Lucena A, da Cunha AS, Simonetti L (2014) Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem. INFORMS J. Comput. 26(4):645–657.Link, Google Scholar
• Kabadurmus O, Smith AE (2015) Multi-commodity k-splittable survivable network design problems with relays. Telecomm. Systems 62(1):1–11.Google Scholar
• Konak A (2012) Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation. Eur. J. Oper. Res. 218(3):829–837.Crossref, Google Scholar
• Kulturel-Konak S, Konak A (2008) A local search hybrid genetic algorithm approach to the network design problem with relay stations. Raghavan S, Golden B, Wasil E, eds. Telecommunications Modeling, Policy, and Technology. Operations Research/Computer Science Interfaces, Vol. 44 (Springer, Boston), 311–324.Crossref, Google Scholar
• Laporte G, Pascoal MMB (2011) Minimum cost path problems with relays. Comput. Oper. Res. 38(1):165–173.Crossref, Google Scholar
• Li X, Aneja YP, Huo J (2012) Using branch-and-price approach to solve the directed network design problem with relays. Omega 40(5):672–679.Crossref, Google Scholar
• Lin S, Li X, Wei K, Yue C (2014) A tabu search based metaheuristic for the network design problem with relays. Ning B, Chen J, Cai X, Zhang Z, Zhang R, Zhang J, eds. Service Systems and Service Management (ICSSSM), 2014 11th Internat. Conf., Beijing, 1–6.Google Scholar
• Ljubić I, Weiskircher R, Pferschy U, Klau GW, Mutzel P, Fischetti M (2006) An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math. Program. 105(2–3):427–449.Crossref, Google Scholar
• Lucena A, Maculan N, Simonetti L (2010) Reformulations and solution algorithms for the maximum leaf spanning tree problem. Comput. Management Sci. 7(3):289–311.Crossref, Google Scholar
• Pelletier S, Jabali O, Laporte G (2016) 50th anniversary invited article—Goods distribution with electric vehicles: Review and research perspectives. Transportation Sci. 50(1):3–22.Link, Google Scholar
• Raghavan S, Stanojević D (2011) Branch and price for WDM optical networks with no bifurcation of flow. INFORMS J. Comput. 23(1):56–74.Link, Google Scholar
• Rahman Q, Bandyopadhyay S, Aneja Y (2015) Optimal regenerator placement in translucent optical networks. Optical Switching Networking 15:134–147.Crossref, Google Scholar
• Schneider M, Stenger A, Goeke D (2014) The electric vehicle-routing problem with time windows and recharging stations. Transportation Sci. 48(4):500–520.Link, Google Scholar
• Sung CS, Song SH (2003) Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network. J. Oper. Res. Soc. 54(1):72–82.Crossref, Google Scholar
• Üster H, Kewcharoenwong P (2011) Strategic design and analysis of a relay network in truckload transportation. Transportation Sci. 45(4):505–523.Link, Google Scholar
• Üster H, Maheshwari N (2007) Strategic network design for multi-zone truckload shipments. IIE Trans. 39(2):177–189.Crossref, Google Scholar
• Xiao Y, Konak A (2017) A variable neighborhood search for the network design problem with relays. J. Heuristics 23(2):1–28.Google Scholar
• Yıldız B, Karaşan OE (2015) Regenerator location problem and survivable extensions: A hub covering location perspective. Transportation Res. Part B: Methodological 71:32–55.Crossref, Google Scholar
• Yıldız B, Karaşan OE (2017) Regenerator location problem in flexible optical networks. Oper. Res. 65(3):595–620.Link, Google Scholar
• Yıldız B, Arslan O, Karaşan OE (2016) A branch and price approach for routing and refueling station location model. Eur. J. Oper. Res. 248(3):815–826.Crossref, Google Scholar
• Yıldız B, Karaşan OE, Yaman H (2018) Branch-and-price approaches for the network design problem with relays. Comput. Oper. Res. 92:155–169.Crossref, Google Scholar