Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
1-center problem
open-in-new
<h2 id="see-also">See also</h2> <ul><li><a href="/facts/Minimum-diameter_spanning_tree/GlaNLf8u">Minimum-diameter spanning tree</a></li> <li><a href="/facts/Optimal_facility_location/ssbU6ww2">Minsum facility location</a> (<a href="/facts/Optimal_facility_location/ssbU6ww2">1-median problem</a>), with <a href="/facts/Geometric_median/aIQYJaHX">geometric median</a> being a special case</li> <li><a href="/facts/Optimal_facility_location/ssbU6ww2">Maxmin facility location</a> (<a href="/facts/Optimal_facility_location/ssbU6ww2">obnoxious facility location</a>)</li> <li><a href="/facts/Optimal_facility_location/ssbU6ww2">k-center problem</a></li> <li><a href="/facts/K-median_problem/09wScbjR">k-median problem</a></li></ul> <ul><li>Megiddo, Nimrod (November 1983). <a href="http://theory.stanford.edu/~megiddo/pdf/weight1.pdf">"The weighted Euclidean 1-center problem"</a> (PDF). <i><a href="/facts/Mathematics_of_Operations_Research/VWfG5pal">Mathematics of Operations Research</a></i>. 8 (4): 498–504. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1287%2Fmoor.8.4.498">10.1287/moor.8.4.498</a>.</li> <li>Foul, Abdelaziz (May 2006). "A 1-center problem on the plane with uniformly distributed demand points". <i><a href="/facts/Operations_Research_Letters/QyEKxpgW">Operations Research Letters</a></i>. 34 (3). Elsevier: 264–268. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2Fj.orl.2005.04.011">10.1016/j.orl.2005.04.011</a>.</li> <li>Chandrasekaran, R. (July 1982). "The weighted euclidean 1-center problem". <i><a href="/facts/Operations_Research_Letters/QyEKxpgW">Operations Research Letters</a></i>. 1 (3). Elsevier: 111–112. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2F0167-6377%2882%2990009-8">10.1016/0167-6377(82)90009-8</a>.</li> <li>Colebrook, M.; J. Gutiérrez, S. Alonso; J. Sicilia (December 2002). "A New Algorithm for the Undesirable 1-Center Problem on Networks". <i><a href="/facts/Journal_of_the_Operational_Research_Society/Jbz6dEGe">Journal of the Operational Research Society</a></i>. 53 (12). Palgrave Macmillan Journals: 1357–1366. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1057%2Fpalgrave.jors.2601468">10.1057/palgrave.jors.2601468</a>. <a href="/facts/JSTOR_(identifier)/YTeVmaJ7">JSTOR</a> <a href="https://www.jstor.org/stable/822725">822725</a>.</li> <li>Burkard, Rainer E.; Helidon Dollani (February 2002). "A Note on the Robust 1-Center Problem on Trees". <i>Annals of Operations Research</i>. 110 (1–4). Kluwer Academic Publishers: 69–82. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1023%2FA%3A1020711416254">10.1023/A:1020711416254</a>. <a href="/facts/ISSN_(identifier)/DPAflDvU">ISSN</a> <a href="https://search.worldcat.org/issn/1572-9338">1572-9338</a>.</li></ul>