Liu, Yanchao An elliptical cover problem in drone delivery network design and its solution algorithms. (English) Zbl 07594675 Eur. J. Oper. Res. 304, No. 3, 912-925 (2023). MSC: 90Bxx PDF BibTeX XML Cite \textit{Y. Liu}, Eur. J. Oper. Res. 304, No. 3, 912--925 (2023; Zbl 07594675) Full Text: DOI OpenURL
Blanco, Víctor; Gázquez, Ricardo Continuous maximal covering location problems with interconnected facilities. (English) Zbl 07485338 Comput. Oper. Res. 132, Article ID 105310, 16 p. (2021). MSC: 90B85 90C10 90C90 90C26 PDF BibTeX XML Cite \textit{V. Blanco} and \textit{R. Gázquez}, Comput. Oper. Res. 132, Article ID 105310, 16 p. (2021; Zbl 07485338) Full Text: DOI arXiv OpenURL
van der Hoog, Ivor; van Kreveld, Marc; Meulemans, Wouter; Verbeek, Kevin; Wulms, Jules Topological stability of kinetic \(k\)-centers. (English) Zbl 1477.68497 Theor. Comput. Sci. 866, 145-159 (2021). MSC: 68U05 68Q25 68W40 90B85 PDF BibTeX XML Cite \textit{I. van der Hoog} et al., Theor. Comput. Sci. 866, 145--159 (2021; Zbl 1477.68497) Full Text: DOI arXiv OpenURL
Tzou, Justin; Wetton, Brian Optimal covering points and curves. (English) Zbl 1486.52050 AIMS Math. 4, No. 6, 1796-1804 (2019). MSC: 52C15 49M15 90C90 PDF BibTeX XML Cite \textit{J. Tzou} and \textit{B. Wetton}, AIMS Math. 4, No. 6, 1796--1804 (2019; Zbl 1486.52050) Full Text: DOI OpenURL
Brimberg, Jack; Drezner, Zvi Solving multiple facilities location problems with separated clusters. (English) Zbl 1476.90173 Oper. Res. Lett. 47, No. 5, 386-390 (2019). MSC: 90B80 90C39 90C59 PDF BibTeX XML Cite \textit{J. Brimberg} and \textit{Z. Drezner}, Oper. Res. Lett. 47, No. 5, 386--390 (2019; Zbl 1476.90173) Full Text: DOI OpenURL
Davoodi, Mansoor \(k\)-balanced center location problem: a new multi-objective facility location problem. (English) Zbl 1458.90426 Comput. Oper. Res. 105, 68-84 (2019). MSC: 90B80 90C29 90C59 68Q25 PDF BibTeX XML Cite \textit{M. Davoodi}, Comput. Oper. Res. 105, 68--84 (2019; Zbl 1458.90426) Full Text: DOI OpenURL
Callaghan, Becky; Salhi, Said; Nagy, Gábor Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane. (English) Zbl 1394.90383 Eur. J. Oper. Res. 257, No. 3, 722-734 (2017). MSC: 90B80 90B85 90C59 90C60 PDF BibTeX XML Cite \textit{B. Callaghan} et al., Eur. J. Oper. Res. 257, No. 3, 722--734 (2017; Zbl 1394.90383) Full Text: DOI OpenURL
Drezner, Zvi; Marianov, Vladimir; Wesolowsky, George O. Maximizing the minimum cover probability by emergency facilities. (English) Zbl 1357.90081 Ann. Oper. Res. 246, No. 1-2, 349-362 (2016). MSC: 90B85 90B10 90C59 PDF BibTeX XML Cite \textit{Z. Drezner} et al., Ann. Oper. Res. 246, No. 1--2, 349--362 (2016; Zbl 1357.90081) Full Text: DOI OpenURL
Callaghan, Becky; Salhi, Saïd; Nagy, Gábor Drezner’s exact method for the continuous \(p\)-centre problem revisited. (English) Zbl 1359.90058 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 41-44 (2016). MSC: 90B85 PDF BibTeX XML Cite \textit{B. Callaghan} et al., Electron. Notes Discrete Math. 55, 41--44 (2016; Zbl 1359.90058) Full Text: DOI OpenURL
Elshaikh, Abdalla; Salhi, Said; Brimberg, Jack; Mladenović, Nenad; Callaghan, Becky; Nagy, Gábor An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem. (English) Zbl 1349.90583 Comput. Oper. Res. 75, 1-11 (2016). MSC: 90B85 90C27 90C59 PDF BibTeX XML Cite \textit{A. Elshaikh} et al., Comput. Oper. Res. 75, 1--11 (2016; Zbl 1349.90583) Full Text: DOI OpenURL
Elshaikh, Abdalla; Salhi, Said; Nagy, Gábor The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory. (English) Zbl 1339.90204 Eur. J. Oper. Res. 241, No. 3, 606-621 (2015). MSC: 90B85 90C59 PDF BibTeX XML Cite \textit{A. Elshaikh} et al., Eur. J. Oper. Res. 241, No. 3, 606--621 (2015; Zbl 1339.90204) Full Text: DOI OpenURL
Lamb, John D. Insertion heuristics for central cycle problems. (English) Zbl 1298.05177 Networks 56, No. 1, 70-80 (2010). MSC: 05C38 05C85 90C27 90C59 PDF BibTeX XML Cite \textit{J. D. Lamb}, Networks 56, No. 1, 70--80 (2010; Zbl 1298.05177) Full Text: DOI OpenURL
Redondo, J. L.; Fernández, J.; García, I.; Ortigosa, P. M. A robust and efficient algorithm for planar competitive location problems. (English) Zbl 1163.90011 Ann. Oper. Res. 167, 87-105 (2009). MSC: 90B85 90C59 PDF BibTeX XML Cite \textit{J. L. Redondo} et al., Ann. Oper. Res. 167, 87--105 (2009; Zbl 1163.90011) Full Text: DOI OpenURL
Suzuki, Atsuo; Drezner, Zvi The minimum equitable radius location problem with continuous demand. (English) Zbl 1161.90010 Eur. J. Oper. Res. 195, No. 1, 17-30 (2009). MSC: 90B85 PDF BibTeX XML Cite \textit{A. Suzuki} and \textit{Z. Drezner}, Eur. J. Oper. Res. 195, No. 1, 17--30 (2009; Zbl 1161.90010) Full Text: DOI OpenURL
Chen, Doron; Chen, Reuven New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems. (English) Zbl 1177.90246 Comput. Oper. Res. 36, No. 5, 1646-1655 (2009). MSC: 90B80 PDF BibTeX XML Cite \textit{D. Chen} and \textit{R. Chen}, Comput. Oper. Res. 36, No. 5, 1646--1655 (2009; Zbl 1177.90246) Full Text: DOI OpenURL
Pelegrín, Blas; Fernández, José; Tóth, Boglárka The 1-center problem in the plane with independent random weights. (English) Zbl 1278.90219 Comput. Oper. Res. 35, No. 3, 737-749 (2008). MSC: 90B85 90C26 PDF BibTeX XML Cite \textit{B. Pelegrín} et al., Comput. Oper. Res. 35, No. 3, 737--749 (2008; Zbl 1278.90219) Full Text: DOI OpenURL
Hassin, Refael; Levin, Asaf; Morad, Dana Lexicographic local search and the \(p\)-center problem. (English) Zbl 1053.90052 Eur. J. Oper. Res. 151, No. 2, 265-279 (2003). MSC: 90B40 90C59 PDF BibTeX XML Cite \textit{R. Hassin} et al., Eur. J. Oper. Res. 151, No. 2, 265--279 (2003; Zbl 1053.90052) Full Text: DOI OpenURL
Mladenović, Nenad; Labbé, Martine; Hansen, Pierre Solving the \(p\)-center problem with tabu search and variable neighborhood search. (English) Zbl 1036.90046 Networks 42, No. 1, 48-64 (2003). Reviewer: Horst W. Hamacher (Kaiserslautern) MSC: 90B80 90C10 90C59 PDF BibTeX XML Cite \textit{N. Mladenović} et al., Networks 42, No. 1, 48--64 (2003; Zbl 1036.90046) Full Text: DOI OpenURL
Caruso, C.; Colorni, A.; Aloi, L. Dominant, an algorithm for the \(p\)-center problem. (English) Zbl 1035.90037 Eur. J. Oper. Res. 149, No. 1, 53-64 (2003). MSC: 90B80 90C27 90C59 PDF BibTeX XML Cite \textit{C. Caruso} et al., Eur. J. Oper. Res. 149, No. 1, 53--64 (2003; Zbl 1035.90037) Full Text: DOI OpenURL
Pelegrin, B.; Cánovas, L. A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem. (English) Zbl 0955.90069 Eur. J. Oper. Res. 104, No. 2, 366-374 (1998). MSC: 90B85 90C59 PDF BibTeX XML Cite \textit{B. Pelegrin} and \textit{L. Cánovas}, Eur. J. Oper. Res. 104, No. 2, 366--374 (1998; Zbl 0955.90069) Full Text: DOI OpenURL
Drezner, Zvi On the conditional \(p\)-median problem. (English) Zbl 0830.90070 Comput. Oper. Res. 22, No. 5, 525-530 (1995). MSC: 90B35 PDF BibTeX XML Cite \textit{Z. Drezner}, Comput. Oper. Res. 22, No. 5, 525--530 (1995; Zbl 0830.90070) Full Text: DOI OpenURL
Nof, Shimon Y.; Drezner, Zvi The multiple-robot assembly plan problem. (English) Zbl 0875.68988 J. Intell. Robot. Syst. 7, No. 1, 57-71 (1993). MSC: 68U99 PDF BibTeX XML Cite \textit{S. Y. Nof} and \textit{Z. Drezner}, J. Intell. Robot. Syst. 7, No. 1, 57--71 (1993; Zbl 0875.68988) Full Text: DOI OpenURL
Hwang, R. Z.; Chang, R. C.; Lee, R. C. T. The searching over separators strategy to solve some NP-hard problems in subexponential time. (English) Zbl 0797.68161 Algorithmica 9, No. 4, 398-423 (1993). MSC: 68U05 68Q25 PDF BibTeX XML Cite \textit{R. Z. Hwang} et al., Algorithmica 9, No. 4, 398--423 (1993; Zbl 0797.68161) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{R. Z. Hwang} et al., Algorithmica 9, No. 1, 1--22 (1993; Zbl 0766.68136) Full Text: DOI OpenURL
Ko, M. T.; Ching, Y. T. Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance. (English) Zbl 0774.68064 Discrete Appl. Math. 40, No. 3, 397-410 (1992). MSC: 68Q25 68U05 PDF BibTeX XML Cite \textit{M. T. Ko} and \textit{Y. T. Ching}, Discrete Appl. Math. 40, No. 3, 397--410 (1992; Zbl 0774.68064) Full Text: DOI OpenURL
Ko, M. T.; Lee, R. C. T. On weighted rectilinear 2-center and 3-center problems. (English) Zbl 0722.90039 Inf. Sci. 54, No. 1-2, 169-190 (1991). Reviewer: P.Loridan (Rantigny) MSC: 90B85 90-08 90C60 PDF BibTeX XML Cite \textit{M. T. Ko} and \textit{R. C. T. Lee}, Inf. Sci. 54, No. 1--2, 169--190 (1991; Zbl 0722.90039) Full Text: DOI OpenURL
Ko, M. T.; Lee, R. C. T.; Chang, J. S. Rectilinear m-center problem. (English) Zbl 0692.90039 Nav. Res. Logist. 37, No. 3, 419-427 (1990). MSC: 90B05 68Q25 PDF BibTeX XML Cite \textit{M. T. Ko} et al., Nav. Res. Logist. 37, No. 3, 419--427 (1990; Zbl 0692.90039) Full Text: DOI OpenURL
Love, Robert F.; Dowling, Paul D. A new bounding method for single facility location models. (English) Zbl 0707.90069 Ann. Oper. Res. 18, No. 1-4, 103-112 (1989). MSC: 90B85 90-08 PDF BibTeX XML Cite \textit{R. F. Love} and \textit{P. D. Dowling}, Ann. Oper. Res. 18, No. 1--4, 103--112 (1989; Zbl 0707.90069) Full Text: DOI OpenURL
Zanakis, Stelios H.; Evans, James R.; Vazacopoulos, Alkis A. Heuristic methods and applications: A categorized survey. (English) Zbl 0681.90090 Eur. J. Oper. Res. 43, No. 1, 88-110 (1989). MSC: 90C99 90-02 65K05 PDF BibTeX XML Cite \textit{S. H. Zanakis} et al., Eur. J. Oper. Res. 43, No. 1, 88--110 (1989; Zbl 0681.90090) Full Text: DOI OpenURL
Aneja, Y. P.; Chandrasekaran, R.; Nair, K. P. K. A note on the m-center problem with rectilinear distances. (English) Zbl 0699.90028 Eur. J. Oper. Res. 35, No. 1, 118-123 (1988). MSC: 90B05 90C35 90C10 PDF BibTeX XML Cite \textit{Y. P. Aneja} et al., Eur. J. Oper. Res. 35, No. 1, 118--123 (1988; Zbl 0699.90028) Full Text: DOI OpenURL
Plesník, Ján A heuristic for the p-center problem in graphs. (English) Zbl 0637.05020 Discrete Appl. Math. 17, 263-268 (1987). Reviewer: H.T.Lau MSC: 05C99 68R10 PDF BibTeX XML Cite \textit{J. Plesník}, Discrete Appl. Math. 17, 263--268 (1987; Zbl 0637.05020) Full Text: DOI OpenURL
Dyer, M. E.; Frieze, A. M. A simple heuristic for the p-centre problem. (English) Zbl 0556.90019 Oper. Res. Lett. 3, 285-288 (1985). MSC: 90B05 65K05 PDF BibTeX XML Cite \textit{M. E. Dyer} and \textit{A. M. Frieze}, Oper. Res. Lett. 3, 285--288 (1985; Zbl 0556.90019) Full Text: DOI OpenURL