Cawood, Mark E.; Dearing, P. M. The weighted Euclidean one-center problem in \(\mathbb{R}^n\). (English) Zbl 07932039 Comput. Optim. Appl. 89, No. 2, 553-574 (2024). MSC: 90Cxx × Cite Format Result Cite Review PDF Full Text: DOI
Ataei, Homa; Davoodi, Mansoor The \(p\)-center problem under locational uncertainty of demand points. (English) Zbl 1509.90112 Discrete Optim. 47, Article ID 100759, 12 p. (2023). MSC: 90B80 68R10 68W25 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, Haitao On the planar two-center problem and circular hulls. (English) Zbl 1535.68435 Discrete Comput. Geom. 68, No. 4, 1175-1226 (2022). MSC: 68U05 68P05 68W40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Vitor, Fabio; Easton, Todd Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming. (English) Zbl 1496.90033 Comput. Optim. Appl. 83, No. 1, 211-246 (2022). MSC: 90C05 90C51 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, Haitao; Xue, Jie Improved algorithms for the bichromatic two-center problem for pairs of points. (English) Zbl 07445247 Comput. Geom. 100, Article ID 101806, 12 p. (2022). MSC: 68Uxx 68Qxx 68Wxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Das, Sandip; Nandy, Ayan; Sarvottamananda, Swami Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions. (English) Zbl 1484.65041 Discrete Appl. Math. 305, 311-328 (2021). Reviewer: Ctirad Matonoha (Praha) MSC: 65D18 68U05 52B55 68Q25 52B12 51K05 51M20 90C05 90C25 × Cite Format Result Cite Review PDF Full Text: DOI
Blanco, Víctor; Puerto, Justo Covering problems with polyellipsoids: a location analysis perspective. (English) Zbl 1487.90452 Eur. J. Oper. Res. 289, No. 1, 44-58 (2021). MSC: 90B85 52C17 90B05 90C11 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Das, Sandip; Nandy, Ayan; Sarvottamananda, Swami Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints. (English) Zbl 1437.68185 Discrete Appl. Math. 280, 71-85 (2020). MSC: 68U05 52B55 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, Haitao; Xue, Jie Improved algorithms for the bichromatic two-center problem for pairs of points. (English) Zbl 1534.68250 Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 578-591 (2019). MSC: 68U05 68W05 68W25 68W40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Oh, Eunjin; Bae, Sang Won; Ahn, Hee-Kap Computing a geodesic two-center of points in a simple polygon. (English) Zbl 1468.68269 Comput. Geom. 82, 45-59 (2019). MSC: 68U05 68W40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Das, Sandip; Nandy, Ayan; Sarvottamananda, Swami Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions. (English) Zbl 1497.68522 Panda, B. S. (ed.) et al., Algorithms and discrete applied mathematics. 4th international conference, CALDAM 2018, Guwahati, India, February 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10743, 283-300 (2018). MSC: 68U05 52B55 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Tan, Xuehou; Jiang, Bo Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem. (English) Zbl 1434.68618 Cao, Yixin (ed.) et al., Computing and combinatorics. 23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10392, 481-491 (2017). MSC: 68U05 68Q25 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Das, Sandip; Nandy, Ayan; Sarvottamananda, Swami Linear time algorithm for 1-center in \(\mathfrak {R}^d\) under convex polyhedral distance function. (English) Zbl 1475.68406 Zhu, Daming (ed.) et al., Frontiers in algorithmics. 10th international workshop, FAW 2016, Qingdao, China, June 30 – July 2, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9711, 41-52 (2016). MSC: 68U05 52B55 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Matsui, Tomomi; Scheifele, Rudolf A linear time algorithm for the unbalanced Hitchcock transportation problem. (English) Zbl 1390.90076 Networks 67, No. 2, 170-182 (2016). MSC: 90B06 × Cite Format Result Cite Review PDF Full Text: DOI
Bereg, Sergey On the 2-center problem under convex polyhedral distance function. (English) Zbl 1484.68271 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, 365-377 (2016). MSC: 68U05 52B55 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Das, Sandip; Nandy, Ayan; Sarvottamananda, Swami Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints. (English) Zbl 1437.68184 Govindarajan, Sathish (ed.) et al., Algorithms and discrete applied mathematics. Second international conference, CALDAM 2016, Thiruvananthapuram, India, February 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9602, 126-138 (2016). MSC: 68U05 52B55 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Bei, Xiaohui; Chen, Ning; Zhang, Shengyu Solving linear programming with constraints unknown. (English) Zbl 1440.90020 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 129-142 (2015). MSC: 90C05 52B55 68Q25 68U05 90C59 90C60 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Wang, Haitao; Zhang, Jingru One-dimensional \(k\)-center on uncertain data. (English) Zbl 1330.90049 Theor. Comput. Sci. 602, 114-124 (2015). MSC: 90B80 68U05 68W05 × Cite Format Result Cite Review PDF Full Text: DOI
Hansen, Thomas Dueholm; Zwick, Uri An improved version of the random-facet pivoting rule for the simplex algorithm. (English) Zbl 1321.90080 Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 209-218 (2015). MSC: 90C05 68Q25 68W20 × Cite Format Result Cite Review PDF Full Text: DOI
Arkin, Esther M.; Díaz-Báñez, José Miguel; Hurtado, Ferran; Kumar, Piyush; Mitchell, Joseph S. B.; Palop, Belén; Pérez-Lantero, Pablo; Saumell, Maria; Silveira, Rodrigo I. Bichromatic 2-center of pairs of points. (English) Zbl 1336.65015 Comput. Geom. 48, No. 2, 94-107 (2015). Reviewer: Jason Hanson (Redmond) MSC: 65D18 × Cite Format Result Cite Review PDF Full Text: DOI
Chen, Danny Z.; Wang, Haitao New algorithms for facility location problems on the real line. (English) Zbl 1360.90156 Algorithmica 69, No. 2, 370-383 (2014). MSC: 90B85 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Drezner, Zvi Continuous center problems. (English) Zbl 1387.90121 Eiselt, H. A. (ed.) et al., Foundations of location analysis. New York, NY: Springer (ISBN 978-1-4419-7571-3/hbk; 978-1-4419-7572-0/ebook). International Series in Operations Research & Management Science 155, 63-78 (2011). MSC: 90B85 × Cite Format Result Cite Review PDF Full Text: DOI
Kumar, Pankaj; Kumar, Piyush Almost optimal solutions to \(k\)-clustering problems. (English) Zbl 1198.65044 Int. J. Comput. Geom. Appl. 20, No. 4, 431-447 (2010). MSC: 65D18 × Cite Format Result Cite Review PDF Full Text: DOI
Puerto, J.; Rodríguez-Chía, A. M.; Tamir, A. On the planar piecewise quadratic 1-center problem. (English) Zbl 1191.68768 Algorithmica 57, No. 2, 252-283 (2010). MSC: 68U05 90B06 90B80 90C20 × Cite Format Result Cite Review PDF Full Text: DOI
Abravaya, S.; Berend, D. Multi-dimensional dynamic facility location and fast computation at query points. (English) Zbl 1191.68751 Inf. Process. Lett. 109, No. 8, 386-390 (2009). MSC: 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Gotoh, Jun-Ya; Konno, Hiroshi Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. (English) Zbl 1098.90047 J. Glob. Optim. 34, No. 1, 1-14 (2006). MSC: 90C20 52B55 65K05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Hoffmann, Michael A simple linear algorithm for computing rectilinear 3-centers. (English) Zbl 1115.68156 Comput. Geom. 31, No. 3, 150-165 (2005). MSC: 68U05 52B55 90B80 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Averbakh, Igor; Bereg, Sergei Facility location problems with uncertainty on the plane. (English) Zbl 1090.90128 Discrete Optim. 2, No. 1, 3-34 (2005). MSC: 90B85 × Cite Format Result Cite Review PDF Full Text: DOI
Li, Lushu; Kabadi, S. N.; Nair, K. P. K. Fuzzy disk for covering fuzzy points. (English) Zbl 1067.90110 Eur. J. Oper. Res. 160, No. 2, 560-573 (2005). MSC: 90B80 90C25 03E72 × Cite Format Result Cite Review PDF Full Text: DOI
Halman, Nir A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane. (English) Zbl 1173.68820 Inf. Process. Lett. 86, No. 3, 121-128 (2003). MSC: 68W05 × Cite Format Result Cite Review PDF Full Text: DOI
Fernández-Baca, David Decomposable multi-parameter matroid optimization problems. (English) Zbl 1045.68047 Theor. Comput. Sci. 297, No. 1-3, 183-198 (2003). MSC: 68P10 × Cite Format Result Cite Review PDF Full Text: DOI
Ahn, Hee-Kap; Cheong, Otfried; Shin, Chan-Su Building bridges between convex regions. (English) Zbl 1022.52003 Comput. Geom. 25, No. 1-2, 161-170 (2003). Reviewer: Mihai Cipu (Bucureşti) MSC: 52A20 52A40 × Cite Format Result Cite Review PDF Full Text: DOI
Chan, Timothy M. Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. (English) Zbl 1152.68659 Int. J. Comput. Geom. Appl. 12, No. 1-2, 67-85 (2002). MSC: 68U05 65D18 68W25 × Cite Format Result Cite Review PDF Full Text: DOI
Chen, Danny Z.; Xu, Jinhui Two-variable linear programming in parallel. (English) Zbl 0998.68191 Comput. Geom. 21, No. 3, 155-165 (2002). MSC: 68U05 68W10 90C05 × Cite Format Result Cite Review PDF Full Text: DOI
Li, Lushu; Kabadi, S. N.; Nair, K. P. K. Fuzzy versions of the covering circle problem. (English) Zbl 1009.90068 Eur. J. Oper. Res. 137, No. 1, 93-109 (2002). MSC: 90B80 90C70 × Cite Format Result Cite Review PDF Full Text: DOI
Huotari, Robert; Prophet, M. P. Constrained optimal location. (English) Zbl 1024.90049 Numer. Funct. Anal. Optimization 22, No. 1-2, 69-78 (2001). MSC: 90B80 41A30 × Cite Format Result Cite Review PDF Full Text: DOI
Drezner, Zvi; Guyse, Jeffery Application of decision analysis techniques to the Weber facility location problem. (English) Zbl 1009.90066 Eur. J. Oper. Res. 116, No. 1, 69-79 (1999). MSC: 90B80 90B50 × Cite Format Result Cite Review PDF Full Text: DOI
Chen, Danny Z.; Xu, Jinhui Two-variable linear programming in parallel. (English) Zbl 1502.68305 Arnborg, Stefan (ed.) et al., Algorithm theory – SWAT’98. 6th Scandinavian workshop on algorithm theory, Stockholm, Sweden, July 8–10, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1432, 169-180 (1998). MSC: 68U05 68W10 90C05 × Cite Format Result Cite Review PDF Full Text: DOI
Hagerup, Torben; Katajainen, Jyrki; Nishimura, Naomi; Ragde, Prabhakar Characterizing multiterminal flow networks and computing flows in networks of small treewidth. (English) Zbl 0917.68013 J. Comput. Syst. Sci. 57, No. 3, 366-375 (1998). MSC: 68M10 × Cite Format Result Cite Review PDF Full Text: DOI
Lin, Guo-Hui; Xue, Guoliang K-center and K-median problems in graded distances. (English) Zbl 0912.68044 Theor. Comput. Sci. 207, No. 1, 181-192 (1998). MSC: 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Matoušek, J.; Sharir, M.; Welzl, E. A subexponential bound for linear programming. (English) Zbl 0857.68119 Algorithmica 16, No. 4-5, 498-516 (1996). MSC: 68U05 68R05 × Cite Format Result Cite Review PDF Full Text: DOI
Agarwala, Richa; Fernández-Baca, David Weighted search in the plane. (English) Zbl 0875.68448 Inf. Process. Lett. 54, No. 2, 97-100 (1995). MSC: 68W10 × Cite Format Result Cite Review PDF Full Text: DOI
Mitchell, Joseph S. B.; Suri, Subhash Separation and approximation of polyhedral objects. (English) Zbl 0831.68113 Comput. Geom. 5, No. 2, 95-114 (1995). MSC: 68U05 × Cite Format Result Cite Review PDF Full Text: DOI
Amenta, N. Helly-type theorems and generalized linear programming. (English) Zbl 0819.90056 Discrete Comput. Geom. 12, No. 3, 241-261 (1994). MSC: 90C05 68U05 × Cite Format Result Cite Review PDF Full Text: DOI EuDML Backlinks: MO
Chazelle, Bernard Computational geometry: a retrospective. (English) Zbl 1345.68261 Proceedings of the 26th annual ACM symposium on theory of computing, STOC ’94, Montreal, Canada, May 23–25, 1994. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-663-8). 75-94 (1994). MSC: 68U05 68-02 × Cite Format Result Cite Review PDF Full Text: DOI
Bhattacharya, B. K.; Jadhav, S.; Mukhopadyay, A.; Robert, J.-M. Optimal algorithms for some intersection radius problems. (English) Zbl 0923.68117 Computing 52, No. 3, 269-279 (1994). MSC: 68U05 52B55 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Konno, Hiroshi; Yajima, Yasutoshi; Ban, Ayumi Calculating a minimal sphere containing a polytope defined by a system of linear inequalities. (English) Zbl 0801.90090 Comput. Optim. Appl. 3, No. 2, 181-191 (1994). MSC: 90C25 52A40 65D18 52B11 52B12 × Cite Format Result Cite Review PDF Full Text: DOI
Sekitani, Kazuyuki; Yamamoto, Yoshitsugu A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes. (English) Zbl 0797.90056 Japan J. Ind. Appl. Math. 10, No. 2, 255-273 (1993). Reviewer: P.Loridan (Rantigny) MSC: 90B85 90C20 × Cite Format Result Cite Review PDF Full Text: DOI
Megiddo, Nimrod; Tamir, Arie Linear time algorithms for some separable quadratic programming problems. (English) Zbl 0793.90049 Oper. Res. Lett. 13, No. 4, 203-211 (1993). MSC: 90C20 90C08 × Cite Format Result Cite Review PDF Full Text: DOI
Houle, Michael E. Algorithms for weak and wide separation of sets. (English) Zbl 0797.68160 Discrete Appl. Math. 45, No. 2, 139-159 (1993). MSC: 68U05 68Q25 68T10 × Cite Format Result Cite Review PDF Full Text: DOI
Monma, Clyde; Suri, Subhash Transitions in geometric minimum spanning trees. (English) Zbl 0764.05022 Discrete Comput. Geom. 8, No. 3, 265-293 (1992). Reviewer: R.G.Wilson (Mexico) MSC: 05C10 05C05 05C12 × Cite Format Result Cite Review PDF Full Text: DOI
Sharir, Micha; Welzl, Emo A combinatorial bound for linear programming and related problems. (English) Zbl 1494.68276 Finkel, A. (ed.) et al., STACS 92. Theoretical aspects of computer science. Proceedings of the 9th annual symposium, Cachan, France, February 13–15, 1992. Berlin: Springer. Lect. Notes Comput. Sci. 577, 569-579 (1992). MSC: 68U05 68W20 90C05 90C25 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Dwyer, Rex A. Convex hulls of samples from spherically symmetric distributions. (English) Zbl 0736.52007 Discrete Appl. Math. 31, No. 2, 113-132 (1991). Reviewer: J. Müller (Wien) MSC: 52B55 52A22 × Cite Format Result Cite Review PDF Full Text: DOI
Seidel, Raimund Small-dimensional linear programming and convex hulls made easy. (English) Zbl 0747.90066 Discrete Comput. Geom. 6, No. 5, 423-434 (1991). Reviewer: T.Rapcsák (Budapest) MSC: 90C05 68Q25 90C60 × Cite Format Result Cite Review PDF Full Text: DOI EuDML
Pollack, R.; Sharir, M.; Rote, G. Computing the geodesic center of a simple polygon. (English) Zbl 0689.68067 Discrete Comput. Geom. 4, No. 6, 611-626 (1989). MSC: 68Q25 68U99 52A10 × Cite Format Result Cite Review PDF Full Text: DOI EuDML
Megiddo, Nimrod On the ball spanned by balls. (English) Zbl 0688.90020 Discrete Comput. Geom. 4, No. 6, 605-610 (1989). Reviewer: X.-S.Zhang MSC: 90B05 68Q25 90C30 90C20 × Cite Format Result Cite Review PDF Full Text: DOI EuDML
Dyer, M. E.; Frieze, A. M. A randomized algorithm for fixed-dimensional linear programming. (English) Zbl 0681.90054 Math. Program., Ser. A 44, No. 2, 203-212 (1989). Reviewer: E.Duca MSC: 90C05 65K05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Reichling, Matthias On the detection of a common intersection of k convex subjects in the plane. (English) Zbl 0657.68040 Inf. Process. Lett. 29, No. 1, 25-29 (1988). MSC: 68Q25 52A10 52A35 × Cite Format Result Cite Review PDF Full Text: DOI
Clarkson, Kenneth L. Linear programming in \(O(n\times 3^{d^2})\) time. (English) Zbl 1418.90148 Inf. Process. Lett. 22, 21-24 (1986). MSC: 90C05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
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 × Cite Format Result Cite Review PDF Full Text: DOI