Demange, Marc; Haddad, Marcel A.; Murat, Cécile Approximating the probabilistic \(p\)-center problem under pressure. (English) Zbl 07929163 J. Comb. Optim. 48, No. 1, Paper No. 9, 25 p. (2024). MSC: 90Cxx × Cite Format Result Cite Review PDF Full Text: DOI
Gaar, Elisabeth; Sinnl, Markus Exact solution approaches for the discrete \(\alpha\)-neighbor \(p\)-center problem. (English) Zbl 1530.90051 Networks 82, No. 4, 371-399 (2023). MSC: 90B80 90C10 90C57 90C59 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Zhang, Qingyun; Lü, Zhipeng; Su, Zhouxing; Li, Chumin A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem. (English) Zbl 07764418 Comput. Oper. Res. 160, Article ID 106373, 15 p. (2023). MSC: 90Bxx × Cite Format Result Cite Review PDF Full Text: DOI
Duran-Mateluna, Cristian; Ales, Zacharie; Elloumi, Sourour; Jorquera-Bravo, Natalia Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem. (English) Zbl 1543.90141 Comput. Oper. Res. 159, Article ID 106334, 13 p. (2023). MSC: 90B80 90C11 90C17 90C57 × Cite Format Result Cite Review PDF Full Text: DOI
Mousavi, Seyed R. Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants. (English) Zbl 1520.90159 Comput. Oper. Res. 149, Article ID 106023, 22 p. (2023). MSC: 90B80 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Liu, Yanchao A faster algorithm for the constrained minimum covering circle problem to expedite solving \(p\)-center problems in an irregularly shaped area with holes. (English) Zbl 1533.90092 Nav. Res. Logist. 69, No. 3, 431-441 (2022). MSC: 90C27 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Sánchez-Oro, J.; López-Sánchez, A. D.; Hernández-Díaz, A. G.; Duarte, A. GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem. (English) Zbl 1507.90091 Eur. J. Oper. Res. 303, No. 1, 143-158 (2022). MSC: 90B80 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Gaar, Elisabeth; Sinnl, Markus A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem. (English) Zbl 1507.90087 Eur. J. Oper. Res. 303, No. 1, 78-98 (2022). MSC: 90B80 90C57 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Calogiuri, Tobia; Ghiani, Gianpaolo; Guerriero, Emanuela; Manni, Emanuele The multi-period \(p\)-center problem with time-dependent travel times. (English) Zbl 1511.90272 Comput. Oper. Res. 136, Article ID 105487, 10 p. (2021). MSC: 90B80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Zhang, Bo; Peng, Jin; Li, Shengguo Minimax models for capacitated \(p\)-center problem in uncertain environment. (English) Zbl 1478.90055 Fuzzy Optim. Decis. Mak. 20, No. 3, 273-292 (2021). MSC: 90B80 90C35 90B06 × Cite Format Result Cite Review PDF Full Text: DOI
Du, Bo; Zhou, Hong; Leus, Roel A two-stage robust model for a reliable \(p\)-center facility location problem. (English) Zbl 1443.90239 Appl. Math. Modelling 77, Part 1, 99-114 (2020). MSC: 90B80 90C35 × Cite Format Result Cite Review PDF Full Text: DOI
López-Sánchez, A. D.; Sánchez-Oro, J.; Hernández-Díaz, A. G. GRASP and VNS for solving the \(p\)-next center problem. (English) Zbl 1458.90446 Comput. Oper. Res. 104, 295-303 (2019). MSC: 90B80 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Contardo, Claudio; Iori, Manuel; Kramer, Raphael A scalable exact algorithm for the vertex \(p\)-center problem. (English) Zbl 1458.90423 Comput. Oper. Res. 103, 211-220 (2019). MSC: 90B80 × Cite Format Result Cite Review PDF Full Text: DOI
Irawan, Chandra A.; Soemadi, Kusmaningrum The capacitated single-source \(p\)-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique. (English) Zbl 1460.90103 Yugosl. J. Oper. Res. 28, No. 4, 453-473 (2018). MSC: 90B85 90C26 × Cite Format Result Cite Review PDF Full Text: DOI
Bai, Chunsong; Kang, Liying; Shan, Erfang The connected \(p\)-center problem on cactus graphs. (English) Zbl 1421.90124 Theor. Comput. Sci. 749, 59-65 (2018). MSC: 90C27 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Bansal, Manish; Kianfar, Kiavash Planar maximum coverage location problem with partial coverage and rectangular demand and service zones. (English) Zbl 1364.90285 INFORMS J. Comput. 29, No. 1, 152-169 (2017). MSC: 90C27 90C57 × Cite Format Result Cite Review PDF Full Text: DOI Link
Bai, Chunsong; Kang, Liying; Shan, Erfang The connected \(p\)-center problem on cactus graphs. (English) Zbl 1421.90123 Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 718-725 (2016). MSC: 90C27 90C39 × Cite Format Result Cite Review PDF Full Text: DOI
Quevedo-Orozco, Dagoberto R.; Ríos-Mercado, Roger Z. Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent. (English) Zbl 1348.90412 Comput. Oper. Res. 62, 133-144 (2015). MSC: 90B80 90C27 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Dantrakul, Sittipong; Likasiri, Chulin A maximal client coverage algorithm for the \(p\)-center problem. (English) Zbl 1257.90054 Thai J. Math. 10, No. 2, 423-432 (2012). MSC: 90C10 × Cite Format Result Cite Review PDF Full Text: Link
Davidović, Tatjana; Ramljak, Dušan; Šelmić, Milica; Teodorović, Dušan Bee colony optimization for the \(p\)-center problem. (English) Zbl 1208.90103 Comput. Oper. Res. 38, No. 10, 1367-1376 (2011). MSC: 90B80 90C59 90C35 68T20 × Cite Format Result Cite Review PDF Full Text: DOI
Ahn, Hee-Kap; Bae, Sang Won; Demaine, Erik D.; Demaine, Martin L.; Kim, Sang-Sub; Korman, Matias; Reinbacher, Iris; Son, Wanbin Covering points by disjoint boxes with outliers. (English) Zbl 1217.68109 Comput. Geom. 44, No. 3, 178-190 (2011). MSC: 68Q25 52B55 52C22 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI Link
Giannakos, Aristotelis Location problems. (English) Zbl 1203.90093 Paschos, Vangelis Th., Combinatorial optimization. Volume 2: Paradigms of combinatorial optimization. Problems and new approaches. London: ISTE; Hoboken, NJ: John Wiley & Sons (ISBN 978-1-84821-148-3/hbk; 978-1-84821-146-9/set). 61-87 (2010). MSC: 90B80 90B85 90-02 × Cite Format Result Cite Review PDF
Özsoy, F. Aykut; Pınar, Mustafa Ç. An exact algorithm for the capacitated vertex \(p\)-center problem. (English) Zbl 1126.90039 Comput. Oper. Res. 33, No. 5, 1420-1436 (2006). MSC: 90B80 90C10 90C90 × Cite Format Result Cite Review PDF Full Text: DOI Link
Current, John; Daskin, Mark; Schilling, David Discrete network location models. (English) Zbl 1061.90070 Drezner, Zvi (ed.) et al., Facility location. Applications and theory. Berlin: Springer (ISBN 3-540-42172-6/hbk). 81-118 (2002). Reviewer: Jaroslav Janáček (Žilina) MSC: 90B80 90B10 90-02 90C59 90C10 × Cite Format Result Cite Review PDF
Rayco, M. Brenda; Francis, Richard L.; Tamir, Arie A \(p\)-center grid-positioning aggregation procedure. (English) Zbl 0940.90064 Comput. Oper. Res. 26, No. 10-11, 1113-1124 (1999). MSC: 90B99 × Cite Format Result Cite Review PDF Full Text: DOI
Sviridenko, M. I. An approximate algorithm for solving the \(p\)-center problem with a triangle inequality. (Russian) Zbl 0913.05056 Diskretn. Anal. Issled. Oper., Ser. 1 5, No. 1, 60-63 (1998). Reviewer: V.F.Murzina (Novosibirsk) MSC: 05C35 05C50 05C85 × Cite Format Result Cite Review PDF
Panigrahy, Rina; Vishwanathan, Sundar An \(O(\log^* n)\) approximation algorithm for the asymmetric \(p\)-center problem. (English) Zbl 0917.68201 J. Algorithms 27, No. 2, 259-268 (1998). MSC: 68T15 × Cite Format Result Cite Review PDF Full Text: DOI
Vishwanathan, Sundar An \(O(\log^* n)\) approximation algorithm for the asymmetric \(p\)-center problem. (English) Zbl 0851.65051 Proceedings of the 7th annual ACM-SIAM symposium on discrete algorithms, held in Atlanta, GA, USA, January 28-30, 1996. Philadelphia, PA: SIAM. 1-5 (1996). Reviewer: J.Terno (Dresden) MSC: 65K05 90C35 × Cite Format Result Cite Review PDF
Suzuki, Atsuo; Drezner, Zvi The \(p\)-center location problem in an area. (English) Zbl 0917.90233 Locat. Sci. 4, No. 1-2, 69-82 (1996). MSC: 90B85 × Cite Format Result Cite Review PDF Full Text: DOI
Francis, Richard L.; Rayco, M. Brenda R. Asymptotically optimal aggregation for some unweighted \(p\)-center problems with rectilinear distances. (English) Zbl 0898.90084 Stud. Locat. Anal. 10, 25-35 (1996). MSC: 90B85 × Cite Format Result Cite Review PDF
Pelegrín, B.; Cánovas, L. New heuristic algorithms for the rectangular \(p\)-cover problem. (English) Zbl 0835.90041 RAIRO, Rech. Opér. 29, No. 1, 73-91 (1995). MSC: 90B85 × Cite Format Result Cite Review PDF Full Text: DOI EuDML
Hansen, Pierre; Labbé, Martine; Minoux, Michel The \(p\)-center-sum location problem. (English) Zbl 0840.90096 Cah. Cent. Étud. Rech. Opér. 36, 203-219 (1994). MSC: 90B80 90C10 × Cite Format Result Cite Review PDF
Jaeger, Mordechai; Goldberg, Jeff A polynomial algorithm for the equal capacity \(p\)-center problem on trees. (English) Zbl 0807.90076 Transp. Sci. 28, No. 2, 167-175 (1994). MSC: 90B80 90C35 90C60 × Cite Format Result Cite Review PDF Full Text: DOI
Klein, C. M.; Kincaid, R. K. The discrete anti-\(p\)-center problem. (English) Zbl 0802.90064 Transp. Sci. 28, No. 1, 77-79 (1994). MSC: 90B80 × Cite Format Result Cite Review PDF Full Text: DOI
Hwang, R. Z.; Lee, R. C. T.; Chang, R. C. The slab dividing approach to solve the Euclidean \(P\)-center problem. (English) Zbl 0766.68136 Algorithmica 9, No. 1, 1-22 (1993). MSC: 68U05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Hudec, O. On alternative \(p\)-center problems. (English) Zbl 0773.90043 Z. Oper. Res. 36, No. 5, 439-445 (1992). MSC: 90B80 90C35 90C60 × Cite Format Result Cite Review PDF Full Text: DOI
Dragan, F. F.; Prisakar’, K. F.; Chepoj, V. D. The location problem on graphs and the Helly property. (Russian) Zbl 0804.05067 Diskretn. Mat. 4, No. 4, 67-73 (1992). MSC: 05C85 68R10 05C12 68Q25 × Cite Format Result Cite Review PDF
Hudec, Oto Vertex location problems. (English) Zbl 0773.05065 Combinatorics, graphs and complexity, Proc. 4th Czech. Symp., Prachatice/Czech. 1990, Ann. Discrete Math. 51, 103-105 (1992). Reviewer: Ma Zhongfan (Beijing) MSC: 05C35 05C50 × Cite Format Result Cite Review PDF
Frederickson, Greg N. Optimal algorithms for tree partitioning. (English) Zbl 0800.68636 Aggarwal, Alok (ed.), Discrete algorithms. Proceedings of the 2nd annual ACM-SIAM symposium, held January 28-30, 1991, in San Francisco, CA (USA). Philadelphia, PA: SIAM. 168-177 (1991). MSC: 68R10 68Q25 68P10 05C05 × Cite Format Result Cite Review PDF
Pelegrin, Blas Heuristic methods for the p-center problem. (English) Zbl 0732.90056 RAIRO, Rech. Opér. 25, No. 1, 65-72 (1991). MSC: 90B85 90-08 × Cite Format Result Cite Review PDF Full Text: DOI EuDML
Pelegrin Pelegrin, Blas The p-center problem in \(R^ n\) with weighted Tchebycheff norms. (English) Zbl 0747.90059 Belg. J. Oper. Res. Stat. Comput. Sci. 31, No. 1-2, 49-62 (1991). MSC: 90B85 90-08 90C60 × Cite Format Result Cite Review PDF
Frederickson, Greg N. Parametric search and locating supply centers in trees. (English) Zbl 0764.68069 Algorithms and data structures, Proc. 2nd Workshop, WADS ’91, Ottawa/Can. 1991, Lect. Notes Comput. Sci. 519, 299-319 (1991). MSC: 68Q25 05C05 × Cite Format Result Cite Review PDF
Handler, Gabriel Y. \(p\)-center problems. (English) Zbl 0731.90049 Discrete location theory, 305-347 (1990). Reviewer: M.Savelsbergh MSC: 90B80 90C60 90-08 90C35 90-02 × Cite Format Result Cite Review PDF
Moreno, José A new result on the complexity of the p-center problem. (Spanish. English summary) Zbl 0692.90042 Trab. Invest. Oper. 5, No. 1, 61-71 (1990). MSC: 90B05 90C35 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
He, Xin; Yesha, Yaacov Efficient parallel algorithms for r-dominating set and p-center problems on trees. (English) Zbl 0686.68054 Algorithmica 5, No. 1, 129-145 (1990). Reviewer: T.Walsh MSC: 68R10 68Q25 05C05 68N25 05C35 05C30 × Cite Format Result Cite Review PDF Full Text: DOI
Martinich, Joseph S. A vertex-closing approach to the p-center problem. (English) Zbl 0696.90022 Nav. Res. Logist. 35, No. 2, 185-201 (1988). MSC: 90B05 90C35 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, D. W.; Kuo, Yuesun A study on two geometric location problems. (English) Zbl 0675.68071 Inf. Process. Lett. 28, No. 6, 281-286 (1988). Reviewer: R.Klette MSC: 68U99 68Q25 52A37 68R99 × Cite Format Result Cite Review PDF Full Text: DOI
Plesník, Ján Two heuristics for the absolute p-center problem in graphs. (English) Zbl 0654.05058 Math. Slovaca 38, No. 3, 227-233 (1988). Reviewer: R.C.Entringer MSC: 05C99 × Cite Format Result Cite Review PDF Full Text: EuDML
Hassin, Refael A computing scheme for network problems with random edge lengths. (English) Zbl 0649.90051 Stochastics in combinatorial optimization, Adv. Sch. CISM, Udine/Italy 1986, 228-232 (1987). Reviewer: R.Hassin MSC: 90B15 65K05 90B05 × Cite Format Result Cite Review PDF
Chen, R.; Handler, G. Y. Relaxation method for the solution of the minimax location-allocation problem in Euclidean space. (English) Zbl 0648.90026 Nav. Res. Logist. 34, No. 6, 775-788 (1987). MSC: 90B05 90C35 65K05 90C90 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Plesník, Ján On the interchange heuristic for locating centers and medians in a graph. (English) Zbl 0642.05030 Math. Slovaca 37, 209-216 (1987). Reviewer: B.Mckay MSC: 05C35 05C38 68R10 × Cite Format Result Cite Review PDF Full Text: EuDML
Tamir, Arie On the solution value of the continuous p-center location problem on a graph. (English) Zbl 0621.90025 Math. Oper. Res. 12, 340-349 (1987). Reviewer: F.Plastria MSC: 90B05 90C35 68Q25 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Drezner, Zvi On the rectangular p-center problem. (English) Zbl 0614.90034 Nav. Res. Logist. 34, No. 1-2, 229-234 (1987). Reviewer: F.Plastria MSC: 90B05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Vijay, James An algorithm for the p-center problem in the plane. (English) Zbl 0608.90020 Transp. Sci. 19, 235-245 (1985). MSC: 90B05 × Cite Format Result Cite Review PDF Full Text: DOI
Kolen, Antoon The round-trip p-center and covering problem on a tree. (English) Zbl 0606.90041 Transp. Sci. 19, 222-234 (1985). MSC: 90B05 90C27 68Q25 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Jeger, M.; Kariv, O. Algorithms for finding p-centers on a weighted tree (for relatively small p). (English) Zbl 0579.90024 Networks 15, 381-389 (1985). MSC: 90B05 90C90 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Megiddo, Nimrod; Supowit, Kenneth J. On the complexity of some common geometric location problems. (English) Zbl 0534.68032 SIAM J. Comput. 13, 182-196 (1984). Reviewer: D.Yu.Grigorev MSC: 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Antoon, Kolen Duality in tree location theory. (English) Zbl 0531.90028 Cah. Cent. Étud. Rech. Opér. 25, 201-215 (1983). MSC: 90B05 90C10 68Q25 49N15 05C05 05C50 90C05 × Cite Format Result Cite Review PDF
Megiddo, Nimrod; Tamir, Arie New results on the complexity of p-center problems. (English) Zbl 0521.68037 SIAM J. Comput. 12, 751-758 (1983). MSC: 68Q25 68R10 05C05 68P10 × Cite Format Result Cite Review PDF Full Text: DOI
Tansel, Barbaros C.; Francis, Richard L.; Lowe, Timothy J. Location on networks: A survey. I: The p-center and p-median problems. (English) Zbl 0513.90022 Manage. Sci. 29, 482-497 (1983). MSC: 90B05 90-02 × Cite Format Result Cite Review PDF Full Text: DOI
Krarup, Jakob; Pruzan, Peter Mark The simple plant location problem: Survey and synthesis. (English) Zbl 0506.90018 Eur. J. Oper. Res. 12, 36-81 (1983). MSC: 90B05 90C10 90-02 90C90 65K05 × Cite Format Result Cite Review PDF Full Text: DOI
Hakimi, S. Louis On locating new facilities in a competitive environment. (English) Zbl 0499.90026 Eur. J. Oper. Res. 12, 29-35 (1983). MSC: 90B85 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Tamir, Arie; Zemel, Eitan Locating centers on a tree with discontinuous supply and demand regions. (English) Zbl 0498.90022 Math. Oper. Res. 7, 183-197 (1982). MSC: 90B05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Hsu, Wen-Lian The distance-domination numbers of trees. (English) Zbl 0487.90049 Oper. Res. Lett. 1, 96-100 (1982). MSC: 90B05 90C35 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Tansel, B. C.; Francis, R. L.; Lowe, T. J.; Chen, M. L. Duality and distance constraints for the nonlinear p-center problem and covering problem on a tree network. (English) Zbl 0486.90037 Oper. Res. 30, 725-744 (1982). MSC: 90B05 × Cite Format Result Cite Review PDF Full Text: DOI
Chandrasekaran, R.; Tamir, A. Polynomially bounded algorithms for locating p-centers on a tree. (English) Zbl 0486.90036 Math. Program. 22, 304-315 (1982). MSC: 90B05 × Cite Format Result Cite Review PDF Full Text: DOI
Krarup, Jakob; Pruzan, Peter Mark Reducibility of minimax to minisum 0-1 programming problems. (English) Zbl 0451.90084 Eur. J. Oper. Res. 6, 125-132 (1981). MSC: 90C09 65K05 90B05 × Cite Format Result Cite Review PDF Full Text: DOI
Frederickson, Greg N.; Johnson, Donald B. Generating and searching sets induced by networks (preliminary version). (English) Zbl 0453.68034 Automata, languages and programming, 7th Colloq., Noordwijkerhout/ Netherlands 1980, Lect. Notes Comput. Sci. 85, 221-233 (1980). MSC: 68R10 05C05 68Q25 68P10 × Cite Format Result Cite Review PDF
Kikuno, Tohru; Yoshida, Noriyoshi; Kakuda, Yoshiaki NP-completeness of some type of p-center problem. (English) Zbl 0452.90025 Discrete Appl. Math. 2, 361-363 (1980). MSC: 90B05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Brans, J. Pierre Industrial location problem. Survey of mathematical treatments. (Dutch) Zbl 0436.90049 Rev. Belg. Stat. Inf. Rech. Oper. 20, No. 1, 26-66 (1980). MSC: 90B05 90C90 90-02 × Cite Format Result Cite Review PDF
Kariv, O.; Hakimi, S. L. An algorithmic approach to network location problems. II: The p-medians. (English) Zbl 0432.90075 SIAM J. Appl. Math. 37, 539-560 (1979). MSC: 90C35 05C05 68Q25 94C15 90B22 05C35 68R10 × Cite Format Result Cite Review PDF Full Text: DOI