A Branch Decomposition Algorithm for the p-Median Problem

References

• Antamoshkin A, Kazakovtsev L (2013) Random search algorithm for the p-median problem. Informatica (Slovenia) 37(3):267–278.Google Scholar
• Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V (2004) Local search heuristics for k-median and facility location problems. SIAM J. Comput. 33(3):544–562.Crossref, Google Scholar
• Avella P, Sassano A (2001) On the p-median polytope. Math. Programming 89(3):395–411.Crossref, Google Scholar
• Avella P, Sassano A, Vasil’ev I (2007) Computational study of large-scale p-median problems. Math. Program. 109(1):89–114.Crossref, Google Scholar
• Avella P, Boccia M, Salerno S, Vasilyev I (2012) An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39(7):1625–1632.Crossref, Google Scholar
• Beasley J (1985) A note on solving large p-median problems. Eur. J. Oper. Res. 21(2):270–273.Crossref, Google Scholar
• Cook W, Seymour P (2003) Tour merging via branch-decomposition. INFORMS J. Comput. 15(3):233–248.Link, Google Scholar
• Elloumi S (2010) A tighter formulation of the p-median problem. J. Combinatorial Optim. 19(1):69–83.Crossref, Google Scholar
• Feo T, Resende M (1995) Greedy randomized adaptive search procedures. J. Global Optim. 6(2):109–133.Crossref, Google Scholar
• García S, Labbé M, Marín A (2011) Solving large p-median problems with a radius formulation. INFORMS J. Comput. 23(4):546–556.Link, Google Scholar
• Hicks IV (2002) Branchwidth heuristics. Congressus Numerantium 159:31–50.Google Scholar
• Hicks IV (2004) Branch decompositions and minor containment. Networks 43(1):1–9.Crossref, Google Scholar
• Hribar M, Daskin M (1997) A dynamic programming heuristic for the p-median problem. Eur. J. Oper. Res. 101(3):499–508.Crossref, Google Scholar
• Kunkel A, Van Itallie E, Wu D (2014) Optimal distribution of medical backpacks and health surveillance assistants in Malawi. Health Care Management Sci. 17(3):230–244.Google Scholar
• Li S, Svensson O (2016) Approximating k-median via pseudo-approximation. SIAM J. Comput. 45(2):530–547.Crossref, Google Scholar
• Rebreyend P, Lemarchand L, Euler R (2015) A computational comparison of different algorithms for very large p-median problems. Ochoa G, Chicano F, eds. Evolutionary Computation in Combinatorial Optimization. EvoCOP 2015. Lecture Notes in Computer Science, Vol. 9026 (Springer International Publishing, Cham, Switzerland), 13–24.Crossref, Google Scholar
• Reinelt G (1991) TSPLIB—A traveling salesman problem library. INFORMS J. Comput. 3(4):376–384.Link, Google Scholar
• Resende M, Werneck R (2004) A hybrid heuristic for the p-median problem. J. Heuristics 10(1):59–88.Crossref, Google Scholar
• Robertson N, Seymour PD (1991) Graph minors. x. obstructions to tree-decomposition. J. Combinatorial Theory, Ser. B 52(2):153–190.Crossref, Google Scholar
• Rolland E, Schilling D, Current J (1997) An efficient tabu search procedure for the p-median problem. Eur. J. Oper. Res. 96(2):329–342.Crossref, Google Scholar