Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

References

• Achterberg T. SCIP: Solving constraint integer programs. Math. Programming Comput. (2009) 1(1):1–41Crossref, Google Scholar
• Balakrishnan A, Altinkemer K. Using a hop-constrained model to generate alternative communication network design. INFORMS J. Comput. (1992) 4(2):192–205Link, Google Scholar
• Bardossy MG, Raghavan S. Dual-based local search for the connected facility location and related problems. INFORMS J. Comput. (2010) 22(4):584–602Link, Google Scholar
• Beasley JE. OR-Library: Distributing test problems by electronic mail. J. Oper. Res. Soc. (1990) 41(11):1069–1072Crossref, Google Scholar
• Cherkassky BV, Goldberg AV. On implementing push-relabel method for the maximum flow problem. Algorithmica (1994) 19(4):390–410Crossref, Google Scholar
• Costa AM, Cordeau J-F, Laporte G. Fast heuristics for the Steiner tree problem with revenues, budget, and hop constraints. Eur. J. Oper. Res. (2008) 190(1):68–78Crossref, Google Scholar
• Costa AM, Cordeau J-F, Laporte G. Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget, and hop constraints. Networks (2009) 53(2):141–159Crossref, Google Scholar
• Dahl G, Gouveia L, Requejo C, Pardalos PM, Resende M. On formulations and methods for the hop-constrained minimum spanning tree problem. Handbook of Optimization in Telecommunications (2006) (Springer, New York) 493–515Crossref, Google Scholar
• Eisenbrand F, Grandoni F, Rothvoß T, Schäfer G. Connected facility location via random facility sampling and core detouring. J. Comput. System Sci. (2010) 76(8):709–726Crossref, Google Scholar
• Gollowitzer S, Ljubić I. MIP models for connected facility location: A theoretical and computational study. Comput. Oper. Res. (2011) 38(2):435–449Crossref, Google Scholar
• Gouveia L. Multicommodity flow models for spanning trees with hop constraints. Eur. J. Oper. Res. (1996) 95(1):178–190Crossref, Google Scholar
• Gouveia L. Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints. INFORMS J. Comput. (1998) 10(2):180–188Link, Google Scholar
• Gouveia L, Sanso B, Soriano P. Using hop-indexed models for constrained spanning and Steiner tree models. Telecommunications Network Planning (1999) (Kluwer, Norwell, MA) 21–32Crossref, Google Scholar
• Gouveia L, Simonetti L, Uchoa E. Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Math. Programming (2011) 128(1–2):123–148Crossref, Google Scholar
• Koch T, Martin A. Solving Steiner tree problems in graphs to optimality. Networks (1998) 32(3):207–232Crossref, Google Scholar
• Kompella VP, Polyzos GC, Pasquale JC. Multicast routing for multimedia communication. IEEE/ACM Trans. Networking (1993) 1(3):286–292Crossref, Google Scholar
• Kratica J, Tošić D, Filipović V, Ljubić I. Solving the simple plant location problem by genetic algorithms. RAIRO—Oper. Res. (2001) 35(1):127–142Crossref, Google Scholar
• Krick C, Räcke H, Westermann M. Approximation algorithms for data management in networks. Theory Comput. Systems (2003) 36(5):497–519Crossref, Google Scholar
• Leitner M, Raidl GR. Branch-and-cut-and-price for capacitated connected facility location. J. Math. Model. Algorithms (2011) 10(3):245–267Crossref, Google Scholar
• Ljubić I, Bartz-Beielstein T, Blesa Aguilera MJ, Blum C, Naujoks B, Roli A, Rudolph G, Sampels M. A hybrid VNS for connected facility location. Hybrid Metaheuristics (2007) 4771(Springer, Berlin) 157–169Lecture Notes in Computer ScienceCrossref, Google Scholar
• Ljubić I, Gollowitzer S, Haouari M, Mahjoub AR. Modeling the hop constrained connected facility location problem on layered graphs. Proc. Internat. Sympos. Combin. Optim. (ISCO), Electronic Notes in Discrete Math. (2010) 36(Elsevier, Amsterdam) 207–214Crossref, Google Scholar
• Magnanti T, Wolsey L, Ball MO, Magnanti TL, Monma CL, Nemhauser GL. Optimal trees. Network Models (1995) 7(North Holland, Amsterdam) 503–615Handbooks in Operations Research Management ScienceCrossref, Google Scholar
• Mahdian M, Ye Y, Zhang J. Approximation algorithms for metric facility location problems. SIAM J. Comput. (2006) 36(2):411–432Crossref, Google Scholar
• Max-Planck-Institut für Informatik UflLib. (2003) . Accessed on March 23, 2012 http://www.mpi-inf.mpg.de/departments/d1/projects/benchmarks/UflLib/Google Scholar
• Pathan M, Buyya R, Buyya R, Pathan M, Vakali A. A taxonomy of CDNs. Content Delivery Networks (2008) 9(Springer, Heidelberg) 33–77Lecture Notes in Electrical EngineeringCrossref, Google Scholar
• Ruthmair M, Raidl GR, Günlük O, Woeginger GJ. A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems. 15th Conf. on Int. Prog. Comb. Opt. (IPCO XV) (2011) (IBM Learning Center, Armonk, NY) 376–388Crossref, Google Scholar
• Tomazic A, Ljubić I. A GRASP algorithm for the connected facility location problem. Internat. Sympos. Applications and the Internet (SAINT) (2008) (IEEE Computer Society)257–260Crossref, Google Scholar
• Voß S. The Steiner tree problem with hop constraints. Ann. Oper. Res. (1999) 86(0):321–345Crossref, Google Scholar